./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7afbbb4b2e6924bc13d55806a21ab7f087433beabc76695e33c51517c3d4e0b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:02:46,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:02:46,079 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:02:46,083 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:02:46,083 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:02:46,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:02:46,107 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:02:46,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:02:46,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:02:46,110 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:02:46,110 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:02:46,111 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:02:46,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:02:46,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:02:46,113 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:02:46,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:02:46,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:02:46,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:02:46,114 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:02:46,114 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:02:46,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:02:46,118 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:02:46,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:02:46,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:02:46,119 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:02:46,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:02:46,119 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:02:46,119 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:02:46,119 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:02:46,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:02:46,120 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:02:46,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:02:46,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:02:46,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:02:46,121 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:02:46,121 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:02:46,121 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:02:46,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:02:46,122 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:02:46,122 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:02:46,123 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:02:46,123 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:02:46,123 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7afbbb4b2e6924bc13d55806a21ab7f087433beabc76695e33c51517c3d4e0b [2024-11-10 07:02:46,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:02:46,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:02:46,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:02:46,349 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:02:46,349 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:02:46,350 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i [2024-11-10 07:02:47,626 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:02:47,824 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:02:47,825 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i [2024-11-10 07:02:47,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a485bc32/b43a36c5eada4a18844fc74ce13d1a8c/FLAG9349b43b1 [2024-11-10 07:02:47,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a485bc32/b43a36c5eada4a18844fc74ce13d1a8c [2024-11-10 07:02:47,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:02:47,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:02:47,858 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:02:47,858 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:02:47,862 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:02:47,863 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:02:47" (1/1) ... [2024-11-10 07:02:47,864 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@868430e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:47, skipping insertion in model container [2024-11-10 07:02:47,864 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:02:47" (1/1) ... [2024-11-10 07:02:47,892 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:02:48,040 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i[916,929] [2024-11-10 07:02:48,118 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:02:48,126 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:02:48,135 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i[916,929] [2024-11-10 07:02:48,164 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:02:48,183 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:02:48,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48 WrapperNode [2024-11-10 07:02:48,183 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:02:48,184 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:02:48,185 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:02:48,185 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:02:48,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (1/1) ... [2024-11-10 07:02:48,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (1/1) ... [2024-11-10 07:02:48,247 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 172 [2024-11-10 07:02:48,247 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:02:48,248 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:02:48,248 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:02:48,248 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:02:48,258 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (1/1) ... [2024-11-10 07:02:48,258 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (1/1) ... [2024-11-10 07:02:48,268 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (1/1) ... [2024-11-10 07:02:48,293 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:02:48,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (1/1) ... [2024-11-10 07:02:48,294 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (1/1) ... [2024-11-10 07:02:48,302 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (1/1) ... [2024-11-10 07:02:48,303 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (1/1) ... [2024-11-10 07:02:48,305 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (1/1) ... [2024-11-10 07:02:48,308 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (1/1) ... [2024-11-10 07:02:48,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:02:48,316 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:02:48,316 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:02:48,317 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:02:48,317 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (1/1) ... [2024-11-10 07:02:48,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:02:48,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:02:48,366 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:02:48,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:02:48,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:02:48,423 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:02:48,424 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:02:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:02:48,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:02:48,424 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:02:48,490 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:02:48,492 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:02:48,862 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 07:02:48,863 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:02:48,880 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:02:48,880 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:02:48,881 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:02:48 BoogieIcfgContainer [2024-11-10 07:02:48,882 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:02:48,884 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:02:48,885 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:02:48,887 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:02:48,887 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:02:47" (1/3) ... [2024-11-10 07:02:48,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10319ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:02:48, skipping insertion in model container [2024-11-10 07:02:48,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:02:48" (2/3) ... [2024-11-10 07:02:48,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10319ed0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:02:48, skipping insertion in model container [2024-11-10 07:02:48,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:02:48" (3/3) ... [2024-11-10 07:02:48,891 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-38.i [2024-11-10 07:02:48,906 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:02:48,906 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:02:48,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:02:48,968 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;@2783fa59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:02:48,969 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:02:48,973 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:02:48,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 07:02:48,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:02:48,987 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:48,988 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:02:48,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:02:48,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1286302449, now seen corresponding path program 1 times [2024-11-10 07:02:49,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:02:49,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33636510] [2024-11-10 07:02:49,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:49,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:02:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:02:49,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:02:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:02:49,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:02:49,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:02:49,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:02:49,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:02:49,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:02:49,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:02:49,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:02:49,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:02:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:02:49,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:02:49,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:02:49,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:02:49,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:02:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:49,765 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:02:49,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:02:49,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33636510] [2024-11-10 07:02:49,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33636510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:02:49,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:02:49,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:02:49,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317677025] [2024-11-10 07:02:49,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:02:49,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:02:49,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:02:49,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:02:49,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:02:49,792 INFO L87 Difference]: Start difference. First operand has 71 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:49,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:02:49,921 INFO L93 Difference]: Finished difference Result 171 states and 283 transitions. [2024-11-10 07:02:49,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:02:49,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 115 [2024-11-10 07:02:49,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:02:49,932 INFO L225 Difference]: With dead ends: 171 [2024-11-10 07:02:49,933 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 07:02:49,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:02:49,938 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 39 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:02:49,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 278 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:02:49,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 07:02:49,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 78. [2024-11-10 07:02:49,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 60 states have internal predecessors, (91), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:02:49,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 123 transitions. [2024-11-10 07:02:49,974 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 123 transitions. Word has length 115 [2024-11-10 07:02:49,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:02:49,975 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 123 transitions. [2024-11-10 07:02:49,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:49,976 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 123 transitions. [2024-11-10 07:02:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 07:02:49,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:02:49,980 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:49,980 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:02:49,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:02:49,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:02:49,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1927854255, now seen corresponding path program 1 times [2024-11-10 07:02:49,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:02:49,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465706456] [2024-11-10 07:02:49,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:49,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:02:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:02:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:02:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:02:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:02:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:02:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:02:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:02:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:02:50,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:02:50,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:02:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:02:50,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:02:50,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:02:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:02:50,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:02:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:02:50,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,158 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:02:50,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:02:50,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465706456] [2024-11-10 07:02:50,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465706456] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:02:50,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:02:50,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:02:50,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040666149] [2024-11-10 07:02:50,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:02:50,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:02:50,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:02:50,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:02:50,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:02:50,165 INFO L87 Difference]: Start difference. First operand 78 states and 123 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:50,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:02:50,319 INFO L93 Difference]: Finished difference Result 326 states and 509 transitions. [2024-11-10 07:02:50,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:02:50,320 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-10 07:02:50,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:02:50,324 INFO L225 Difference]: With dead ends: 326 [2024-11-10 07:02:50,325 INFO L226 Difference]: Without dead ends: 251 [2024-11-10 07:02:50,326 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:02:50,327 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 203 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:02:50,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 404 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:02:50,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-10 07:02:50,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 151. [2024-11-10 07:02:50,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 126 states have (on average 1.4841269841269842) internal successors, (187), 127 states have internal predecessors, (187), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 07:02:50,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 231 transitions. [2024-11-10 07:02:50,353 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 231 transitions. Word has length 116 [2024-11-10 07:02:50,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:02:50,353 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 231 transitions. [2024-11-10 07:02:50,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:50,353 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 231 transitions. [2024-11-10 07:02:50,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 07:02:50,355 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:02:50,355 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:50,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:02:50,356 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:02:50,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:02:50,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1731340750, now seen corresponding path program 1 times [2024-11-10 07:02:50,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:02:50,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268901529] [2024-11-10 07:02:50,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:50,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:02:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:02:50,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:02:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:02:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:02:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:02:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:02:50,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:02:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:02:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:02:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:02:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:02:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:02:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:02:50,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:02:50,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:02:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:02:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,670 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:02:50,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:02:50,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268901529] [2024-11-10 07:02:50,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268901529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:02:50,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:02:50,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:02:50,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983197490] [2024-11-10 07:02:50,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:02:50,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:02:50,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:02:50,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:02:50,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:02:50,673 INFO L87 Difference]: Start difference. First operand 151 states and 231 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:50,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:02:50,771 INFO L93 Difference]: Finished difference Result 421 states and 633 transitions. [2024-11-10 07:02:50,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:02:50,772 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 116 [2024-11-10 07:02:50,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:02:50,774 INFO L225 Difference]: With dead ends: 421 [2024-11-10 07:02:50,774 INFO L226 Difference]: Without dead ends: 273 [2024-11-10 07:02:50,775 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:02:50,776 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 209 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:02:50,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 445 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:02:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2024-11-10 07:02:50,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 149. [2024-11-10 07:02:50,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 124 states have (on average 1.4274193548387097) internal successors, (177), 125 states have internal predecessors, (177), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 07:02:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 221 transitions. [2024-11-10 07:02:50,799 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 221 transitions. Word has length 116 [2024-11-10 07:02:50,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:02:50,799 INFO L471 AbstractCegarLoop]: Abstraction has 149 states and 221 transitions. [2024-11-10 07:02:50,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 221 transitions. [2024-11-10 07:02:50,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 07:02:50,801 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:02:50,801 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:50,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:02:50,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:02:50,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:02:50,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1056074737, now seen corresponding path program 1 times [2024-11-10 07:02:50,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:02:50,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424495684] [2024-11-10 07:02:50,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:50,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:02:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:02:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:02:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:02:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:02:50,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:02:50,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:02:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:02:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:50,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:02:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:51,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:02:51,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:51,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:02:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:51,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:02:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:51,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:02:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:51,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:02:51,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:51,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:02:51,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:51,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:02:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:51,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:02:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 07:02:51,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:02:51,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424495684] [2024-11-10 07:02:51,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424495684] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:02:51,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1585802353] [2024-11-10 07:02:51,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:51,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:02:51,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:02:51,032 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:02:51,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 07:02:51,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:51,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:02:51,159 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:02:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 243 proven. 27 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-10 07:02:51,287 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:02:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 07:02:51,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1585802353] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:02:51,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:02:51,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-10 07:02:51,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644654773] [2024-11-10 07:02:51,418 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:02:51,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:02:51,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:02:51,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:02:51,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:02:51,420 INFO L87 Difference]: Start difference. First operand 149 states and 221 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 07:02:51,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:02:51,601 INFO L93 Difference]: Finished difference Result 261 states and 385 transitions. [2024-11-10 07:02:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:02:51,602 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 116 [2024-11-10 07:02:51,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:02:51,604 INFO L225 Difference]: With dead ends: 261 [2024-11-10 07:02:51,605 INFO L226 Difference]: Without dead ends: 115 [2024-11-10 07:02:51,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 260 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:02:51,609 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 61 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:02:51,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 250 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:02:51,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-10 07:02:51,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2024-11-10 07:02:51,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.3488372093023255) internal successors, (116), 87 states have internal predecessors, (116), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 07:02:51,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2024-11-10 07:02:51,619 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 116 [2024-11-10 07:02:51,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:02:51,619 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2024-11-10 07:02:51,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 7 states have internal predecessors, (48), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 07:02:51,620 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2024-11-10 07:02:51,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 07:02:51,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:02:51,621 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:51,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-10 07:02:51,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:02:51,822 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:02:51,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:02:51,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1315116940, now seen corresponding path program 1 times [2024-11-10 07:02:51,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:02:51,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059588635] [2024-11-10 07:02:51,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:51,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:02:51,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:02:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:02:52,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:02:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:02:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:02:52,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:02:52,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:02:52,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:02:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:02:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:02:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:02:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:02:52,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:02:52,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:02:52,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:02:52,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:02:52,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:02:52,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:02:52,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059588635] [2024-11-10 07:02:52,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059588635] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:02:52,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:02:52,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 07:02:52,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810607948] [2024-11-10 07:02:52,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:02:52,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:02:52,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:02:52,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:02:52,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:02:52,978 INFO L87 Difference]: Start difference. First operand 112 states and 160 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 07:02:53,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:02:53,278 INFO L93 Difference]: Finished difference Result 431 states and 619 transitions. [2024-11-10 07:02:53,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 07:02:53,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 117 [2024-11-10 07:02:53,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:02:53,284 INFO L225 Difference]: With dead ends: 431 [2024-11-10 07:02:53,284 INFO L226 Difference]: Without dead ends: 338 [2024-11-10 07:02:53,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:02:53,286 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 265 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:02:53,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 519 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:02:53,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-10 07:02:53,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 235. [2024-11-10 07:02:53,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 191 states have (on average 1.3926701570680629) internal successors, (266), 192 states have internal predecessors, (266), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 37 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-10 07:02:53,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 342 transitions. [2024-11-10 07:02:53,311 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 342 transitions. Word has length 117 [2024-11-10 07:02:53,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:02:53,312 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 342 transitions. [2024-11-10 07:02:53,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 07:02:53,312 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 342 transitions. [2024-11-10 07:02:53,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 07:02:53,313 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:02:53,313 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:53,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 07:02:53,314 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:02:53,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:02:53,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2135378485, now seen corresponding path program 1 times [2024-11-10 07:02:53,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:02:53,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013897205] [2024-11-10 07:02:53,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:53,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:02:53,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:02:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:02:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:02:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:02:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:02:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:02:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:02:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:02:53,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:02:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:02:53,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:02:53,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:02:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:02:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:02:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:02:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,567 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:02:53,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:53,569 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:02:53,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:02:53,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013897205] [2024-11-10 07:02:53,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013897205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:02:53,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:02:53,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:02:53,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474355397] [2024-11-10 07:02:53,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:02:53,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:02:53,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:02:53,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:02:53,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:02:53,571 INFO L87 Difference]: Start difference. First operand 235 states and 342 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:02:53,681 INFO L93 Difference]: Finished difference Result 645 states and 925 transitions. [2024-11-10 07:02:53,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:02:53,682 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-10 07:02:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:02:53,684 INFO L225 Difference]: With dead ends: 645 [2024-11-10 07:02:53,684 INFO L226 Difference]: Without dead ends: 429 [2024-11-10 07:02:53,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:02:53,686 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 218 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:02:53,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 266 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:02:53,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-10 07:02:53,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 349. [2024-11-10 07:02:53,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 293 states have (on average 1.3822525597269624) internal successors, (405), 295 states have internal predecessors, (405), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 07:02:53,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 497 transitions. [2024-11-10 07:02:53,703 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 497 transitions. Word has length 117 [2024-11-10 07:02:53,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:02:53,703 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 497 transitions. [2024-11-10 07:02:53,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:53,704 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 497 transitions. [2024-11-10 07:02:53,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 07:02:53,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:02:53,705 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:53,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 07:02:53,705 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:02:53,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:02:53,706 INFO L85 PathProgramCache]: Analyzing trace with hash 231034520, now seen corresponding path program 1 times [2024-11-10 07:02:53,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:02:53,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517200155] [2024-11-10 07:02:53,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:53,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:02:53,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:02:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:02:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:02:54,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:02:54,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:02:54,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:02:54,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:02:54,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:02:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:02:54,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:02:54,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:02:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:02:54,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:02:54,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:02:54,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:02:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:02:54,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 07:02:54,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:02:54,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517200155] [2024-11-10 07:02:54,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517200155] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 07:02:54,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [204813162] [2024-11-10 07:02:54,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:54,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:02:54,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:02:54,085 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:02:54,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 07:02:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:54,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 07:02:54,190 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:02:54,418 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 07:02:54,418 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:02:54,818 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 07:02:54,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [204813162] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:02:54,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 07:02:54,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2024-11-10 07:02:54,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168103752] [2024-11-10 07:02:54,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 07:02:54,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 07:02:54,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:02:54,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 07:02:54,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:02:54,820 INFO L87 Difference]: Start difference. First operand 349 states and 497 transitions. Second operand has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-10 07:02:55,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:02:55,421 INFO L93 Difference]: Finished difference Result 1342 states and 1871 transitions. [2024-11-10 07:02:55,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 07:02:55,422 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) Word has length 117 [2024-11-10 07:02:55,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:02:55,426 INFO L225 Difference]: With dead ends: 1342 [2024-11-10 07:02:55,426 INFO L226 Difference]: Without dead ends: 996 [2024-11-10 07:02:55,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=213, Invalid=543, Unknown=0, NotChecked=0, Total=756 [2024-11-10 07:02:55,428 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 510 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:02:55,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 581 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:02:55,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 996 states. [2024-11-10 07:02:55,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 996 to 413. [2024-11-10 07:02:55,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 341 states have (on average 1.3313782991202345) internal successors, (454), 344 states have internal predecessors, (454), 54 states have call successors, (54), 17 states have call predecessors, (54), 17 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 07:02:55,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 562 transitions. [2024-11-10 07:02:55,460 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 562 transitions. Word has length 117 [2024-11-10 07:02:55,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:02:55,460 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 562 transitions. [2024-11-10 07:02:55,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.083333333333333) internal successors, (85), 12 states have internal predecessors, (85), 3 states have call successors, (46), 2 states have call predecessors, (46), 4 states have return successors, (47), 2 states have call predecessors, (47), 3 states have call successors, (47) [2024-11-10 07:02:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 562 transitions. [2024-11-10 07:02:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-10 07:02:55,462 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:02:55,462 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:55,476 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 07:02:55,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-10 07:02:55,663 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:02:55,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:02:55,664 INFO L85 PathProgramCache]: Analyzing trace with hash -863387915, now seen corresponding path program 1 times [2024-11-10 07:02:55,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:02:55,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724173739] [2024-11-10 07:02:55,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:55,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:02:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:02:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:02:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:02:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:02:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:02:56,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:02:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:02:56,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:02:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:02:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:02:56,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:02:56,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:02:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:02:56,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:02:56,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:02:56,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:02:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,165 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:02:56,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:02:56,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724173739] [2024-11-10 07:02:56,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724173739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:02:56,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:02:56,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 07:02:56,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652924923] [2024-11-10 07:02:56,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:02:56,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:02:56,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:02:56,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:02:56,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:02:56,167 INFO L87 Difference]: Start difference. First operand 413 states and 562 transitions. Second operand has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:56,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:02:56,393 INFO L93 Difference]: Finished difference Result 707 states and 948 transitions. [2024-11-10 07:02:56,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:02:56,394 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 117 [2024-11-10 07:02:56,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:02:56,396 INFO L225 Difference]: With dead ends: 707 [2024-11-10 07:02:56,396 INFO L226 Difference]: Without dead ends: 426 [2024-11-10 07:02:56,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:02:56,398 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 127 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:02:56,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 536 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:02:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-11-10 07:02:56,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 166. [2024-11-10 07:02:56,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 144 states have (on average 1.3402777777777777) internal successors, (193), 144 states have internal predecessors, (193), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:02:56,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 225 transitions. [2024-11-10 07:02:56,417 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 225 transitions. Word has length 117 [2024-11-10 07:02:56,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:02:56,418 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 225 transitions. [2024-11-10 07:02:56,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.714285714285714) internal successors, (40), 7 states have internal predecessors, (40), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:56,418 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 225 transitions. [2024-11-10 07:02:56,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 07:02:56,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:02:56,419 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:56,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 07:02:56,419 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:02:56,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:02:56,420 INFO L85 PathProgramCache]: Analyzing trace with hash -423936564, now seen corresponding path program 1 times [2024-11-10 07:02:56,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:02:56,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674321642] [2024-11-10 07:02:56,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:56,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:02:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:02:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:02:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:02:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:02:56,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:02:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:02:56,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:02:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:02:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:02:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:02:56,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:02:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:02:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:02:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:02:56,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:02:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:02:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,522 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:02:56,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:02:56,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674321642] [2024-11-10 07:02:56,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674321642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:02:56,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:02:56,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:02:56,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766164608] [2024-11-10 07:02:56,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:02:56,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:02:56,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:02:56,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:02:56,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:02:56,525 INFO L87 Difference]: Start difference. First operand 166 states and 225 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:56,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:02:56,541 INFO L93 Difference]: Finished difference Result 329 states and 447 transitions. [2024-11-10 07:02:56,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:02:56,542 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-10 07:02:56,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:02:56,544 INFO L225 Difference]: With dead ends: 329 [2024-11-10 07:02:56,544 INFO L226 Difference]: Without dead ends: 166 [2024-11-10 07:02:56,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:02:56,546 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 50 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:02:56,546 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 95 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:02:56,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-10 07:02:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2024-11-10 07:02:56,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 144 states have (on average 1.3333333333333333) internal successors, (192), 144 states have internal predecessors, (192), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:02:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 224 transitions. [2024-11-10 07:02:56,561 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 224 transitions. Word has length 118 [2024-11-10 07:02:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:02:56,561 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 224 transitions. [2024-11-10 07:02:56,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 224 transitions. [2024-11-10 07:02:56,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 07:02:56,562 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:02:56,562 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:56,562 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 07:02:56,562 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:02:56,562 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:02:56,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1441196629, now seen corresponding path program 1 times [2024-11-10 07:02:56,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:02:56,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788955461] [2024-11-10 07:02:56,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:56,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:02:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:02:56,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:02:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:02:56,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:02:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:02:56,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:02:56,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:02:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:02:56,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:02:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:02:56,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:02:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:02:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:02:56,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:02:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:02:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:02:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:02:56,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:02:56,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788955461] [2024-11-10 07:02:56,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788955461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:02:56,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:02:56,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:02:56,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228299285] [2024-11-10 07:02:56,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:02:56,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:02:56,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:02:56,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:02:56,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:02:56,644 INFO L87 Difference]: Start difference. First operand 166 states and 224 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:56,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:02:56,679 INFO L93 Difference]: Finished difference Result 414 states and 549 transitions. [2024-11-10 07:02:56,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:02:56,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-10 07:02:56,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:02:56,681 INFO L225 Difference]: With dead ends: 414 [2024-11-10 07:02:56,681 INFO L226 Difference]: Without dead ends: 251 [2024-11-10 07:02:56,682 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:02:56,682 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 88 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:02:56,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 192 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:02:56,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-10 07:02:56,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 162. [2024-11-10 07:02:56,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 140 states have (on average 1.3) internal successors, (182), 140 states have internal predecessors, (182), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:02:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 214 transitions. [2024-11-10 07:02:56,700 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 214 transitions. Word has length 118 [2024-11-10 07:02:56,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:02:56,700 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 214 transitions. [2024-11-10 07:02:56,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:56,701 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 214 transitions. [2024-11-10 07:02:56,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 07:02:56,701 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:02:56,702 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:56,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 07:02:56,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:02:56,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:02:56,702 INFO L85 PathProgramCache]: Analyzing trace with hash -87886932, now seen corresponding path program 1 times [2024-11-10 07:02:56,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:02:56,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114411872] [2024-11-10 07:02:56,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:56,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:02:56,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:02:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:02:56,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:02:56,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:02:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:02:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-10 07:02:56,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 07:02:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:02:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:02:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-10 07:02:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 07:02:56,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-10 07:02:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 07:02:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-10 07:02:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 07:02:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-10 07:02:56,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:02:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:02:56,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:02:56,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114411872] [2024-11-10 07:02:56,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114411872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:02:56,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:02:56,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:02:56,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936370071] [2024-11-10 07:02:56,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:02:56,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:02:56,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:02:56,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:02:56,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:02:56,942 INFO L87 Difference]: Start difference. First operand 162 states and 214 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:02:56,992 INFO L93 Difference]: Finished difference Result 325 states and 428 transitions. [2024-11-10 07:02:56,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:02:56,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-10 07:02:56,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:02:56,993 INFO L225 Difference]: With dead ends: 325 [2024-11-10 07:02:56,993 INFO L226 Difference]: Without dead ends: 166 [2024-11-10 07:02:56,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:02:56,994 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 50 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:02:56,995 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 226 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:02:56,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-10 07:02:57,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 145. [2024-11-10 07:02:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 123 states have (on average 1.2682926829268293) internal successors, (156), 123 states have internal predecessors, (156), 16 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:02:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 188 transitions. [2024-11-10 07:02:57,013 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 188 transitions. Word has length 118 [2024-11-10 07:02:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:02:57,013 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 188 transitions. [2024-11-10 07:02:57,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:02:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 188 transitions. [2024-11-10 07:02:57,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 07:02:57,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:02:57,014 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:57,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 07:02:57,014 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:02:57,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:02:57,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1114098503, now seen corresponding path program 1 times [2024-11-10 07:02:57,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:02:57,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225894958] [2024-11-10 07:02:57,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:57,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:02:57,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 07:02:57,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [333456373] [2024-11-10 07:02:57,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:02:57,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:02:57,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:02:57,105 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 07:02:57,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 07:02:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:02:57,451 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:02:57,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:02:57,566 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:02:57,567 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:02:57,568 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:02:57,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-10 07:02:57,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 07:02:57,777 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:02:57,855 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:02:57,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:02:57 BoogieIcfgContainer [2024-11-10 07:02:57,859 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:02:57,859 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:02:57,860 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:02:57,860 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:02:57,860 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:02:48" (3/4) ... [2024-11-10 07:02:57,862 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:02:57,863 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:02:57,864 INFO L158 Benchmark]: Toolchain (without parser) took 10008.68ms. Allocated memory was 153.1MB in the beginning and 400.6MB in the end (delta: 247.5MB). Free memory was 98.3MB in the beginning and 211.7MB in the end (delta: -113.4MB). Peak memory consumption was 136.2MB. Max. memory is 16.1GB. [2024-11-10 07:02:57,864 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 153.1MB. Free memory is still 113.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:02:57,864 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.07ms. Allocated memory is still 153.1MB. Free memory was 97.9MB in the beginning and 79.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 07:02:57,864 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.34ms. Allocated memory is still 153.1MB. Free memory was 79.0MB in the beginning and 74.0MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:02:57,864 INFO L158 Benchmark]: Boogie Preprocessor took 67.70ms. Allocated memory is still 153.1MB. Free memory was 74.0MB in the beginning and 63.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 07:02:57,865 INFO L158 Benchmark]: IcfgBuilder took 565.60ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 63.0MB in the beginning and 175.9MB in the end (delta: -112.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 07:02:57,865 INFO L158 Benchmark]: TraceAbstraction took 8975.19ms. Allocated memory was 230.7MB in the beginning and 400.6MB in the end (delta: 169.9MB). Free memory was 174.8MB in the beginning and 211.7MB in the end (delta: -36.9MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. [2024-11-10 07:02:57,866 INFO L158 Benchmark]: Witness Printer took 3.71ms. Allocated memory is still 400.6MB. Free memory is still 211.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:02:57,867 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.15ms. Allocated memory is still 153.1MB. Free memory is still 113.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.07ms. Allocated memory is still 153.1MB. Free memory was 97.9MB in the beginning and 79.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.34ms. Allocated memory is still 153.1MB. Free memory was 79.0MB in the beginning and 74.0MB in the end (delta: 5.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.70ms. Allocated memory is still 153.1MB. Free memory was 74.0MB in the beginning and 63.0MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 565.60ms. Allocated memory was 153.1MB in the beginning and 230.7MB in the end (delta: 77.6MB). Free memory was 63.0MB in the beginning and 175.9MB in the end (delta: -112.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 8975.19ms. Allocated memory was 230.7MB in the beginning and 400.6MB in the end (delta: 169.9MB). Free memory was 174.8MB in the beginning and 211.7MB in the end (delta: -36.9MB). Peak memory consumption was 131.9MB. Max. memory is 16.1GB. * Witness Printer took 3.71ms. Allocated memory is still 400.6MB. Free memory is still 211.7MB. 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 someBinaryDOUBLEComparisonOperation at line 179, overapproximation of someBinaryFLOATComparisonOperation at line 179, overapproximation of someBinaryArithmeticFLOAToperation at line 134. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 200; [L23] unsigned short int var_1_5 = 42139; [L24] unsigned short int var_1_7 = 1; [L25] double var_1_9 = 0.1; [L26] float var_1_12 = 10000000000.5; [L27] float var_1_13 = 255.6; [L28] float var_1_14 = 128.2; [L29] signed long int var_1_15 = 500; [L30] unsigned char var_1_16 = 0; [L31] unsigned char var_1_17 = 0; [L32] unsigned char var_1_18 = 0; [L33] signed char var_1_19 = -5; [L34] signed char var_1_20 = -1; [L35] signed char var_1_21 = 8; [L36] float var_1_22 = 3.75; [L37] signed short int var_1_23 = 10; [L38] unsigned long int var_1_24 = 8; [L39] unsigned char var_1_25 = 5; [L40] unsigned char var_1_26 = 50; [L41] float var_1_27 = 4.5; [L42] unsigned short int var_1_28 = 5; [L43] unsigned long int var_1_29 = 50; [L44] double var_1_30 = 3.5; [L45] unsigned char var_1_31 = 1; [L46] float last_1_var_1_12 = 10000000000.5; [L47] signed short int last_1_var_1_23 = 10; [L48] unsigned long int last_1_var_1_24 = 8; [L49] unsigned char last_1_var_1_25 = 5; [L50] unsigned long int last_1_var_1_29 = 50; [L51] unsigned char last_1_var_1_31 = 1; VAL [isInitial=0, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=42139, var_1_7=1, var_1_9=1/10] [L183] isInitial = 1 [L184] FCALL initially() [L185] int k_loop; [L186] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=42139, var_1_7=1, var_1_9=1/10] [L186] COND TRUE k_loop < 1 [L187] CALL updateLastVariables() [L171] last_1_var_1_12 = var_1_12 [L172] last_1_var_1_23 = var_1_23 [L173] last_1_var_1_24 = var_1_24 [L174] last_1_var_1_25 = var_1_25 [L175] last_1_var_1_29 = var_1_29 [L176] last_1_var_1_31 = var_1_31 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=42139, var_1_7=1, var_1_9=1/10] [L187] RET updateLastVariables() [L188] CALL updateVariables() [L144] var_1_5 = __VERIFIER_nondet_ushort() [L145] CALL assume_abort_if_not(var_1_5 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L145] RET assume_abort_if_not(var_1_5 >= 32767) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L146] CALL assume_abort_if_not(var_1_5 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L146] RET assume_abort_if_not(var_1_5 <= 65534) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1, var_1_9=1/10] [L147] var_1_9 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L148] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L149] CALL assume_abort_if_not(var_1_9 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L149] RET assume_abort_if_not(var_1_9 != 0.0F) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_13=1278/5, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L150] var_1_13 = __VERIFIER_nondet_float() [L151] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L151] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_14=641/5, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L152] var_1_14 = __VERIFIER_nondet_float() [L153] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L153] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=0, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L154] var_1_17 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_17 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L155] RET assume_abort_if_not(var_1_17 >= 1) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L156] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L156] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L157] var_1_18 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L158] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L159] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L159] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=-1, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L160] var_1_20 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_20 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L161] RET assume_abort_if_not(var_1_20 >= -127) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L162] CALL assume_abort_if_not(var_1_20 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L162] RET assume_abort_if_not(var_1_20 <= 126) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=8, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L163] var_1_21 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_21 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L164] RET assume_abort_if_not(var_1_21 >= -127) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L165] CALL assume_abort_if_not(var_1_21 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L165] RET assume_abort_if_not(var_1_21 <= 126) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=50, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L166] var_1_26 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L167] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L168] CALL assume_abort_if_not(var_1_26 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L168] RET assume_abort_if_not(var_1_26 <= 254) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L188] RET updateVariables() [L189] CALL step() [L55] unsigned short int stepLocal_1 = var_1_5; [L56] unsigned long int stepLocal_0 = (last_1_var_1_25 + last_1_var_1_23) + (last_1_var_1_29 / var_1_5); VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=1] [L57] COND FALSE !((last_1_var_1_12 / var_1_9) != last_1_var_1_12) [L76] var_1_7 = var_1_5 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L78] COND FALSE !(\read(var_1_18)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L81] COND TRUE \read(var_1_17) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L82] COND FALSE !(((((var_1_29) > (var_1_5)) ? (var_1_29) : (var_1_5))) < ((((4) < 0 ) ? -(4) : (4)))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=-5, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=7/2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L86] var_1_19 = ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21))) [L87] var_1_30 = var_1_14 [L88] var_1_31 = var_1_17 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L89] COND FALSE !(var_1_13 != 4.5f) [L96] var_1_16 = (var_1_18 || (! var_1_17)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=15/4, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L98] COND TRUE var_1_16 || var_1_17 [L99] var_1_22 = ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=5, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L101] COND TRUE \read(var_1_31) [L102] var_1_25 = (4 + 8) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=5, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L106] COND TRUE var_1_13 != var_1_22 [L107] var_1_28 = var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=200, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L111] COND FALSE !(\read(var_1_16)) [L114] var_1_1 = (((((var_1_5 - var_1_25)) < ((var_1_25 + (256 + 1)))) ? ((var_1_5 - var_1_25)) : ((var_1_25 + (256 + 1))))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L116] unsigned short int stepLocal_3 = var_1_5; VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, stepLocal_3=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L117] COND TRUE stepLocal_3 >= ((((var_1_25) < (var_1_7)) ? (var_1_25) : (var_1_7))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=500, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L118] COND TRUE ! var_1_16 [L119] var_1_15 = var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=8, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L122] COND FALSE !(var_1_16 || var_1_18) [L125] var_1_24 = ((((2u) > (100u)) ? (2u) : (100u))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L127] signed long int stepLocal_2 = ((((-64) < (var_1_28)) ? (-64) : (var_1_28))) + (var_1_25 << 1); VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, stepLocal_2=-40, var_1_12=20000000001/2, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L128] COND TRUE stepLocal_2 < var_1_7 [L129] var_1_12 = (((((var_1_13 - 128.9f)) < (var_1_14)) ? ((var_1_13 - 128.9f)) : (var_1_14))) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L131] COND TRUE var_1_1 != var_1_25 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L132] COND TRUE var_1_23 >= -128 VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_27=9/2, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L133] COND TRUE var_1_30 != ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))) [L134] var_1_27 = (var_1_13 - (99999.4f + 9.999999999125E9f)) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, stepLocal_0=15, stepLocal_1=32767, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L189] RET step() [L190] CALL, EXPR property() [L179-L180] return ((((((((((((((var_1_16 ? (var_1_1 == ((unsigned short int) (((((var_1_25 + var_1_25)) < ((var_1_5 - ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25)))))) ? ((var_1_25 + var_1_25)) : ((var_1_5 - ((((var_1_25) < 0 ) ? -(var_1_25) : (var_1_25))))))))) : (var_1_1 == ((unsigned short int) (((((var_1_5 - var_1_25)) < ((var_1_25 + (256 + 1)))) ? ((var_1_5 - var_1_25)) : ((var_1_25 + (256 + 1)))))))) && (((last_1_var_1_12 / var_1_9) != last_1_var_1_12) ? ((var_1_9 >= last_1_var_1_12) ? (var_1_7 == ((unsigned short int) last_1_var_1_25)) : ((var_1_5 <= last_1_var_1_25) ? ((last_1_var_1_25 < ((last_1_var_1_25 + last_1_var_1_23) + (last_1_var_1_29 / var_1_5))) ? (last_1_var_1_31 ? (var_1_7 == ((unsigned short int) 5)) : (var_1_7 == ((unsigned short int) last_1_var_1_25))) : (var_1_7 == ((unsigned short int) last_1_var_1_25))) : (var_1_7 == ((unsigned short int) last_1_var_1_25)))) : (var_1_7 == ((unsigned short int) var_1_5)))) && (((((((-64) < (var_1_28)) ? (-64) : (var_1_28))) + (var_1_25 << 1)) < var_1_7) ? (var_1_12 == ((float) (((((var_1_13 - 128.9f)) < (var_1_14)) ? ((var_1_13 - 128.9f)) : (var_1_14))))) : 1)) && ((var_1_5 >= ((((var_1_25) < (var_1_7)) ? (var_1_25) : (var_1_7)))) ? ((! var_1_16) ? (var_1_15 == ((signed long int) var_1_25)) : 1) : 1)) && ((var_1_13 != 4.5f) ? (var_1_31 ? (var_1_16 == ((unsigned char) var_1_17)) : (var_1_16 == ((unsigned char) (! 0)))) : (var_1_16 == ((unsigned char) (var_1_18 || (! var_1_17)))))) && (var_1_19 == ((signed char) ((((var_1_20) > (var_1_21)) ? (var_1_20) : (var_1_21)))))) && ((var_1_16 || var_1_17) ? (var_1_22 == ((float) ((((var_1_14) > (var_1_13)) ? (var_1_14) : (var_1_13))))) : 1)) && (var_1_17 ? ((((((var_1_29) > (var_1_5)) ? (var_1_29) : (var_1_5))) < ((((4) < 0 ) ? -(4) : (4)))) ? (var_1_23 == ((signed short int) var_1_20)) : 1) : 1)) && ((var_1_16 || var_1_18) ? (var_1_24 == ((unsigned long int) ((((last_1_var_1_24) > (var_1_25)) ? (last_1_var_1_24) : (var_1_25))))) : (var_1_24 == ((unsigned long int) ((((2u) > (100u)) ? (2u) : (100u))))))) && (var_1_31 ? (var_1_25 == ((unsigned char) (4 + 8))) : (var_1_25 == ((unsigned char) ((((var_1_26) < 0 ) ? -(var_1_26) : (var_1_26))))))) && ((var_1_1 != var_1_25) ? ((var_1_23 >= -128) ? ((var_1_30 != ((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))) ? (var_1_27 == ((float) (var_1_13 - (99999.4f + 9.999999999125E9f)))) : (var_1_27 == ((float) ((((0.8f) > (var_1_13)) ? (0.8f) : (var_1_13)))))) : 1) : (var_1_27 == ((float) var_1_14)))) && ((var_1_13 != var_1_22) ? (var_1_28 == ((unsigned short int) var_1_25)) : (var_1_28 == ((unsigned short int) (var_1_5 - 10))))) && (var_1_18 ? (var_1_29 == ((unsigned long int) (((((var_1_7 + 100000000u)) > (var_1_26)) ? ((var_1_7 + 100000000u)) : (var_1_26))))) : 1)) && (var_1_30 == ((double) var_1_14))) && (var_1_31 == ((unsigned char) var_1_17)) ; VAL [\result=0, isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L190] RET, EXPR property() [L190] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=20000000001/2, last_1_var_1_23=10, last_1_var_1_24=8, last_1_var_1_25=5, last_1_var_1_29=50, last_1_var_1_31=1, var_1_12=3, var_1_13=0, var_1_14=2, var_1_15=12, var_1_16=0, var_1_17=1, var_1_18=0, var_1_19=11, var_1_1=269, var_1_20=11, var_1_21=11, var_1_22=2, var_1_23=10, var_1_24=100, var_1_25=12, var_1_26=0, var_1_28=12, var_1_29=50, var_1_30=2, var_1_31=1, var_1_5=32767, var_1_7=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 71 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 12, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1828 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1820 mSDsluCounter, 3792 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2442 mSDsCounter, 172 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1304 IncrementalHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 172 mSolverCounterUnsat, 1350 mSDtfsCounter, 1304 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 908 GetRequests, 843 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=413occurred in iteration=7, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 1380 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 1756 NumberOfCodeBlocks, 1756 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1736 ConstructedInterpolants, 0 QuantifiedInterpolants, 5151 SizeOfPredicates, 5 NumberOfNonLiveVariables, 644 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 6984/7200 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 07:02:57,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c7afbbb4b2e6924bc13d55806a21ab7f087433beabc76695e33c51517c3d4e0b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:02:59,722 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:02:59,787 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:02:59,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:02:59,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:02:59,822 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:02:59,823 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:02:59,823 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:02:59,824 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:02:59,824 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:02:59,824 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:02:59,824 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:02:59,825 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:02:59,826 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:02:59,828 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:02:59,828 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:02:59,828 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:02:59,828 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:02:59,829 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:02:59,829 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:02:59,829 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:02:59,829 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:02:59,829 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:02:59,831 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:02:59,831 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:02:59,831 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:02:59,831 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:02:59,832 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:02:59,832 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:02:59,832 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:02:59,832 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:02:59,832 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:02:59,832 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:02:59,832 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:02:59,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:02:59,833 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:02:59,833 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:02:59,833 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:02:59,833 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:02:59,833 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:02:59,833 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:02:59,835 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:02:59,835 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:02:59,835 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:02:59,835 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c7afbbb4b2e6924bc13d55806a21ab7f087433beabc76695e33c51517c3d4e0b [2024-11-10 07:03:00,078 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:03:00,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:03:00,105 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:03:00,106 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:03:00,106 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:03:00,107 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i [2024-11-10 07:03:01,506 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:03:01,695 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:03:01,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i [2024-11-10 07:03:01,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86b6c0480/d0ca632bc66941e4b8386ad3151992d6/FLAGbbded1ad8 [2024-11-10 07:03:01,720 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86b6c0480/d0ca632bc66941e4b8386ad3151992d6 [2024-11-10 07:03:01,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:03:01,728 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:03:01,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:03:01,730 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:03:01,736 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:03:01,737 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:01" (1/1) ... [2024-11-10 07:03:01,750 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12de4f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:01, skipping insertion in model container [2024-11-10 07:03:01,750 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:03:01" (1/1) ... [2024-11-10 07:03:01,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:03:01,971 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i[916,929] [2024-11-10 07:03:02,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:03:02,076 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:03:02,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-38.i[916,929] [2024-11-10 07:03:02,140 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:03:02,163 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:03:02,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02 WrapperNode [2024-11-10 07:03:02,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:03:02,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:03:02,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:03:02,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:03:02,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (1/1) ... [2024-11-10 07:03:02,188 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (1/1) ... [2024-11-10 07:03:02,224 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 170 [2024-11-10 07:03:02,228 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:03:02,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:03:02,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:03:02,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:03:02,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (1/1) ... [2024-11-10 07:03:02,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (1/1) ... [2024-11-10 07:03:02,245 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (1/1) ... [2024-11-10 07:03:02,266 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:03:02,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (1/1) ... [2024-11-10 07:03:02,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (1/1) ... [2024-11-10 07:03:02,281 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (1/1) ... [2024-11-10 07:03:02,282 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (1/1) ... [2024-11-10 07:03:02,288 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (1/1) ... [2024-11-10 07:03:02,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (1/1) ... [2024-11-10 07:03:02,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:03:02,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:03:02,305 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:03:02,305 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:03:02,305 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (1/1) ... [2024-11-10 07:03:02,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:03:02,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:03:02,332 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:03:02,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:03:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:03:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:03:02,368 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:03:02,369 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:03:02,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:03:02,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:03:02,479 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:03:02,483 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:03:17,378 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-10 07:03:17,379 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:03:17,390 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:03:17,391 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:03:17,391 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:17 BoogieIcfgContainer [2024-11-10 07:03:17,391 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:03:17,393 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:03:17,393 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:03:17,396 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:03:17,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:03:01" (1/3) ... [2024-11-10 07:03:17,397 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f68dc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:03:17, skipping insertion in model container [2024-11-10 07:03:17,398 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:03:02" (2/3) ... [2024-11-10 07:03:17,398 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f68dc4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:03:17, skipping insertion in model container [2024-11-10 07:03:17,399 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:03:17" (3/3) ... [2024-11-10 07:03:17,400 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-38.i [2024-11-10 07:03:17,412 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:03:17,412 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:03:17,470 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:03:17,481 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;@66359989, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:03:17,482 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:03:17,486 INFO L276 IsEmpty]: Start isEmpty. Operand has 71 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:03:17,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-10 07:03:17,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:17,500 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:17,501 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:17,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:17,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1286302449, now seen corresponding path program 1 times [2024-11-10 07:03:17,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:03:17,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147220966] [2024-11-10 07:03:17,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:17,520 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:03:17,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:03:17,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:03:17,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 07:03:18,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:18,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-10 07:03:18,375 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:03:20,641 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 243 proven. 27 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2024-11-10 07:03:20,641 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:03:23,351 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 18 proven. 27 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 07:03:23,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:03:23,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147220966] [2024-11-10 07:03:23,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147220966] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:03:23,353 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:03:23,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-10 07:03:23,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115000619] [2024-11-10 07:03:23,356 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:03:23,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:03:23,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:03:23,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:03:23,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:03:23,384 INFO L87 Difference]: Start difference. First operand has 71 states, 52 states have (on average 1.5) internal successors, (78), 53 states have internal predecessors, (78), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 07:03:30,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:03:34,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:03:38,741 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:03:39,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:03:39,592 INFO L93 Difference]: Finished difference Result 161 states and 269 transitions. [2024-11-10 07:03:39,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:03:39,595 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 115 [2024-11-10 07:03:39,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:03:39,601 INFO L225 Difference]: With dead ends: 161 [2024-11-10 07:03:39,601 INFO L226 Difference]: Without dead ends: 85 [2024-11-10 07:03:39,603 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:03:39,605 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 123 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 15 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.8s IncrementalHoareTripleChecker+Time [2024-11-10 07:03:39,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 275 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 166 Invalid, 3 Unknown, 0 Unchecked, 15.8s Time] [2024-11-10 07:03:39,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-10 07:03:39,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2024-11-10 07:03:39,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 58 states have internal predecessors, (77), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-10 07:03:39,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 121 transitions. [2024-11-10 07:03:39,641 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 121 transitions. Word has length 115 [2024-11-10 07:03:39,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:03:39,642 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 121 transitions. [2024-11-10 07:03:39,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-10 07:03:39,642 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 121 transitions. [2024-11-10 07:03:39,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-10 07:03:39,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:03:39,645 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:03:39,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 07:03:39,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:03:39,847 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:03:39,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:03:39,848 INFO L85 PathProgramCache]: Analyzing trace with hash -197443701, now seen corresponding path program 1 times [2024-11-10 07:03:39,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:03:39,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [773951218] [2024-11-10 07:03:39,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:03:39,848 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:03:39,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:03:39,851 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:03:39,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 07:03:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:03:40,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 07:03:40,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:03:48,594 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-10 07:03:48,594 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 07:03:55,950 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-10 07:03:55,951 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:03:55,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [773951218] [2024-11-10 07:03:55,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [773951218] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 07:03:55,951 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 07:03:55,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-10 07:03:55,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268947379] [2024-11-10 07:03:55,952 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 07:03:55,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 07:03:55,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:03:55,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 07:03:55,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:03:55,958 INFO L87 Difference]: Start difference. First operand 82 states and 121 transitions. Second operand has 9 states, 9 states have (on average 7.444444444444445) internal successors, (67), 9 states have internal predecessors, (67), 4 states have call successors, (32), 3 states have call predecessors, (32), 4 states have return successors, (32), 2 states have call predecessors, (32), 4 states have call successors, (32) [2024-11-10 07:04:02,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.27s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:06,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:10,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:16,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:04:20,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []