./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d 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_fillercode_fillercodestructure_filler-pr-ci_file-50.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 1aa5ccf491fa19757c49751a869c16c8e81ee57a7445aa2b11849a454021fdb2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:23:51,943 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:23:52,021 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 14:23:52,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:23:52,026 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:23:52,061 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:23:52,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:23:52,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:23:52,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:23:52,064 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:23:52,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:23:52,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:23:52,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:23:52,067 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:23:52,067 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:23:52,068 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:23:52,068 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:23:52,068 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:23:52,069 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 14:23:52,069 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:23:52,069 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:23:52,074 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:23:52,074 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:23:52,075 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:23:52,075 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:23:52,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:23:52,075 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:23:52,076 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:23:52,076 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:23:52,076 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:23:52,077 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:23:52,077 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:23:52,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:23:52,077 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:23:52,078 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:23:52,078 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:23:52,078 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 14:23:52,078 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 14:23:52,079 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:23:52,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:23:52,080 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:23:52,080 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:23:52,081 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 -> 1aa5ccf491fa19757c49751a869c16c8e81ee57a7445aa2b11849a454021fdb2 [2024-11-16 14:23:52,314 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:23:52,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:23:52,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:23:52,365 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:23:52,365 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:23:52,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2024-11-16 14:23:53,801 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:23:54,023 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:23:54,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2024-11-16 14:23:54,039 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4796a5bea/c470b5e4e14542d5983ce279f675732f/FLAG58ad29461 [2024-11-16 14:23:54,050 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4796a5bea/c470b5e4e14542d5983ce279f675732f [2024-11-16 14:23:54,053 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:23:54,054 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:23:54,056 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:23:54,056 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:23:54,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:23:54,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,063 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6508356f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54, skipping insertion in model container [2024-11-16 14:23:54,063 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,095 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:23:54,271 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_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2024-11-16 14:23:54,369 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:23:54,387 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:23:54,397 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_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2024-11-16 14:23:54,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:23:54,459 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:23:54,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54 WrapperNode [2024-11-16 14:23:54,460 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:23:54,461 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:23:54,461 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:23:54,461 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:23:54,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,479 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,523 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 208 [2024-11-16 14:23:54,524 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:23:54,525 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:23:54,525 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:23:54,525 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:23:54,556 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,598 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-16 14:23:54,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,619 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,635 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,644 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:23:54,649 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:23:54,649 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:23:54,649 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:23:54,650 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (1/1) ... [2024-11-16 14:23:54,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:23:54,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:23:54,686 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-16 14:23:54,689 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-16 14:23:54,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:23:54,735 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:23:54,736 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:23:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 14:23:54,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:23:54,737 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:23:54,837 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:23:54,839 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:23:55,291 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-16 14:23:55,291 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:23:55,318 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:23:55,319 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-16 14:23:55,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:23:55 BoogieIcfgContainer [2024-11-16 14:23:55,320 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:23:55,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:23:55,323 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:23:55,326 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:23:55,326 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:23:54" (1/3) ... [2024-11-16 14:23:55,327 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eccc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:23:55, skipping insertion in model container [2024-11-16 14:23:55,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:23:54" (2/3) ... [2024-11-16 14:23:55,328 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eccc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:23:55, skipping insertion in model container [2024-11-16 14:23:55,328 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:23:55" (3/3) ... [2024-11-16 14:23:55,330 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2024-11-16 14:23:55,345 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:23:55,345 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:23:55,400 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:23:55,411 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;@366b1c35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:23:55,411 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:23:55,416 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:23:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-16 14:23:55,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:55,435 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:55,436 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:55,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:55,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1933981657, now seen corresponding path program 1 times [2024-11-16 14:23:55,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:55,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871395707] [2024-11-16 14:23:55,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:55,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:55,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:23:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:23:55,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:23:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:23:55,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:23:55,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:23:55,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:55,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:23:55,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:23:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:23:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:23:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:23:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:23:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:23:55,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:23:55,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:23:55,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:23:55,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:23:55,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:23:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:23:55,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:23:55,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:55,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871395707] [2024-11-16 14:23:55,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871395707] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:23:55,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:23:55,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:23:55,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967383193] [2024-11-16 14:23:55,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:23:55,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:23:55,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:55,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:23:55,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:23:55,933 INFO L87 Difference]: Start difference. First operand has 93 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 67 states have internal predecessors, (93), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:23:55,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:55,978 INFO L93 Difference]: Finished difference Result 178 states and 299 transitions. [2024-11-16 14:23:55,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:23:55,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 166 [2024-11-16 14:23:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:55,990 INFO L225 Difference]: With dead ends: 178 [2024-11-16 14:23:55,990 INFO L226 Difference]: Without dead ends: 88 [2024-11-16 14:23:55,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:23:55,997 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 130 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-16 14:23:55,999 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 130 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:23:56,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-16 14:23:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-16 14:23:56,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.3709677419354838) internal successors, (85), 62 states have internal predecessors, (85), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:23:56,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 133 transitions. [2024-11-16 14:23:56,070 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 133 transitions. Word has length 166 [2024-11-16 14:23:56,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:56,070 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 133 transitions. [2024-11-16 14:23:56,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:23:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 133 transitions. [2024-11-16 14:23:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-16 14:23:56,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:56,083 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:56,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 14:23:56,084 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:56,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:56,085 INFO L85 PathProgramCache]: Analyzing trace with hash -594345541, now seen corresponding path program 1 times [2024-11-16 14:23:56,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:56,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892175074] [2024-11-16 14:23:56,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:56,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:56,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:23:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:23:56,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:23:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:23:56,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:23:56,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:23:56,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:56,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:23:56,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:23:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:23:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:23:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:23:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:23:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:23:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:23:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:23:56,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:23:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:23:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:23:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:23:56,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:23:56,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:56,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892175074] [2024-11-16 14:23:56,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892175074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:23:56,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:23:56,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:23:56,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253592495] [2024-11-16 14:23:56,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:23:56,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:23:56,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:56,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:23:56,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:23:56,538 INFO L87 Difference]: Start difference. First operand 88 states and 133 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:23:56,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:56,614 INFO L93 Difference]: Finished difference Result 221 states and 333 transitions. [2024-11-16 14:23:56,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:23:56,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2024-11-16 14:23:56,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:56,617 INFO L225 Difference]: With dead ends: 221 [2024-11-16 14:23:56,617 INFO L226 Difference]: Without dead ends: 136 [2024-11-16 14:23:56,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-16 14:23:56,619 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 56 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:56,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 236 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:23:56,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-16 14:23:56,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 132. [2024-11-16 14:23:56,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 104 states have internal predecessors, (146), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 14:23:56,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 198 transitions. [2024-11-16 14:23:56,651 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 198 transitions. Word has length 166 [2024-11-16 14:23:56,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:56,653 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 198 transitions. [2024-11-16 14:23:56,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:23:56,653 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 198 transitions. [2024-11-16 14:23:56,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-16 14:23:56,657 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:56,657 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:56,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 14:23:56,658 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:56,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:56,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1903670396, now seen corresponding path program 1 times [2024-11-16 14:23:56,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:56,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133483459] [2024-11-16 14:23:56,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:56,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:56,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:23:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:23:56,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:23:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:23:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:23:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:23:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:23:56,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:23:56,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:23:56,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:23:56,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:23:56,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:23:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:23:56,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:23:56,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:23:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:23:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:23:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:23:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:56,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:23:56,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:23:56,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:56,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133483459] [2024-11-16 14:23:56,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133483459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:23:56,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:23:56,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 14:23:56,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662122614] [2024-11-16 14:23:56,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:23:56,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 14:23:56,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:56,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 14:23:56,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 14:23:56,913 INFO L87 Difference]: Start difference. First operand 132 states and 198 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:23:56,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:56,971 INFO L93 Difference]: Finished difference Result 263 states and 397 transitions. [2024-11-16 14:23:56,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 14:23:56,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 166 [2024-11-16 14:23:56,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:56,976 INFO L225 Difference]: With dead ends: 263 [2024-11-16 14:23:56,976 INFO L226 Difference]: Without dead ends: 134 [2024-11-16 14:23:56,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 50 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-16 14:23:56,981 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:56,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 251 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:23:56,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-16 14:23:56,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-16 14:23:56,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 106 states have internal predecessors, (148), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 14:23:56,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 200 transitions. [2024-11-16 14:23:56,995 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 200 transitions. Word has length 166 [2024-11-16 14:23:56,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:56,996 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 200 transitions. [2024-11-16 14:23:56,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:23:56,996 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 200 transitions. [2024-11-16 14:23:56,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 14:23:56,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:56,999 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:56,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 14:23:56,999 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:57,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:57,000 INFO L85 PathProgramCache]: Analyzing trace with hash 59598374, now seen corresponding path program 1 times [2024-11-16 14:23:57,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:57,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561137526] [2024-11-16 14:23:57,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:57,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:57,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:23:57,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:23:57,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:23:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:23:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:23:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:23:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:23:57,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:23:57,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:23:57,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:23:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:23:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:23:57,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:23:57,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:23:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:23:57,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:23:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:23:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:23:57,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:57,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:57,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:23:57,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:23:57,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:57,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561137526] [2024-11-16 14:23:57,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561137526] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:23:57,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:23:57,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:23:57,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265149673] [2024-11-16 14:23:57,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:23:57,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:23:57,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:57,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:23:57,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:23:57,291 INFO L87 Difference]: Start difference. First operand 134 states and 200 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:23:57,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:57,530 INFO L93 Difference]: Finished difference Result 394 states and 590 transitions. [2024-11-16 14:23:57,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:23:57,530 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-16 14:23:57,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:57,537 INFO L225 Difference]: With dead ends: 394 [2024-11-16 14:23:57,537 INFO L226 Difference]: Without dead ends: 263 [2024-11-16 14:23:57,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-16 14:23:57,539 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 121 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:57,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 299 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 14:23:57,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2024-11-16 14:23:57,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 160. [2024-11-16 14:23:57,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 131 states have (on average 1.4351145038167938) internal successors, (188), 132 states have internal predecessors, (188), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-16 14:23:57,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 240 transitions. [2024-11-16 14:23:57,573 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 240 transitions. Word has length 167 [2024-11-16 14:23:57,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:57,574 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 240 transitions. [2024-11-16 14:23:57,575 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:23:57,575 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 240 transitions. [2024-11-16 14:23:57,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 14:23:57,578 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:57,579 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:57,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 14:23:57,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:57,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:57,581 INFO L85 PathProgramCache]: Analyzing trace with hash -233804633, now seen corresponding path program 1 times [2024-11-16 14:23:57,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:57,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380002222] [2024-11-16 14:23:57,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:57,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:58,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:23:58,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:23:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:23:58,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:23:58,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:23:58,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:23:58,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:58,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:23:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:23:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:23:58,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:23:58,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:23:58,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:23:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:23:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:23:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:23:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:23:58,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:23:58,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:23:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:23:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:58,217 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:23:58,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:58,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380002222] [2024-11-16 14:23:58,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380002222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:23:58,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:23:58,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 14:23:58,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974647785] [2024-11-16 14:23:58,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:23:58,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:23:58,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:58,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:23:58,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:23:58,221 INFO L87 Difference]: Start difference. First operand 160 states and 240 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:23:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:23:58,746 INFO L93 Difference]: Finished difference Result 571 states and 837 transitions. [2024-11-16 14:23:58,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 14:23:58,747 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 167 [2024-11-16 14:23:58,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:23:58,750 INFO L225 Difference]: With dead ends: 571 [2024-11-16 14:23:58,750 INFO L226 Difference]: Without dead ends: 414 [2024-11-16 14:23:58,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-16 14:23:58,755 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 350 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 14:23:58,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [350 Valid, 287 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 14:23:58,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-11-16 14:23:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 243. [2024-11-16 14:23:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 203 states have (on average 1.4137931034482758) internal successors, (287), 206 states have internal predecessors, (287), 35 states have call successors, (35), 4 states have call predecessors, (35), 4 states have return successors, (35), 32 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-16 14:23:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 357 transitions. [2024-11-16 14:23:58,806 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 357 transitions. Word has length 167 [2024-11-16 14:23:58,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:23:58,807 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 357 transitions. [2024-11-16 14:23:58,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:23:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 357 transitions. [2024-11-16 14:23:58,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 14:23:58,809 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:23:58,809 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:23:58,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 14:23:58,809 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:23:58,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:23:58,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1509005702, now seen corresponding path program 1 times [2024-11-16 14:23:58,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:23:58,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908725709] [2024-11-16 14:23:58,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:23:58,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:23:58,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:23:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:23:59,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:23:59,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:23:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:23:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:23:59,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:23:59,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:23:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:23:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:23:59,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:23:59,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:23:59,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:23:59,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:23:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:23:59,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:23:59,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:23:59,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:23:59,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:23:59,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:23:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:23:59,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:23:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:23:59,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:23:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:23:59,505 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:23:59,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:23:59,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908725709] [2024-11-16 14:23:59,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908725709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:23:59,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:23:59,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 14:23:59,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607890828] [2024-11-16 14:23:59,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:23:59,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 14:23:59,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:23:59,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 14:23:59,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:23:59,510 INFO L87 Difference]: Start difference. First operand 243 states and 357 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:24:00,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:00,107 INFO L93 Difference]: Finished difference Result 715 states and 1026 transitions. [2024-11-16 14:24:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 14:24:00,108 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-16 14:24:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:00,115 INFO L225 Difference]: With dead ends: 715 [2024-11-16 14:24:00,115 INFO L226 Difference]: Without dead ends: 475 [2024-11-16 14:24:00,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:24:00,118 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 254 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:00,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 465 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 14:24:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-11-16 14:24:00,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 373. [2024-11-16 14:24:00,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 287 states have (on average 1.3449477351916377) internal successors, (386), 293 states have internal predecessors, (386), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-16 14:24:00,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 534 transitions. [2024-11-16 14:24:00,183 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 534 transitions. Word has length 167 [2024-11-16 14:24:00,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:00,184 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 534 transitions. [2024-11-16 14:24:00,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:24:00,184 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 534 transitions. [2024-11-16 14:24:00,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 14:24:00,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:00,186 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:00,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 14:24:00,186 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:00,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:00,187 INFO L85 PathProgramCache]: Analyzing trace with hash -1978457915, now seen corresponding path program 1 times [2024-11-16 14:24:00,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:00,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872480729] [2024-11-16 14:24:00,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:00,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:00,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:24:00,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:24:00,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:24:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:24:00,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:24:00,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:24:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:24:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:24:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:24:00,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:24:00,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:24:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:24:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:24:00,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:24:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:24:00,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:24:00,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:24:00,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:24:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:24:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:24:00,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:24:00,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:24:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:24:00,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:24:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:00,385 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:24:00,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:24:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872480729] [2024-11-16 14:24:00,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872480729] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:24:00,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:24:00,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:24:00,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209535175] [2024-11-16 14:24:00,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:24:00,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:24:00,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:24:00,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:24:00,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:24:00,388 INFO L87 Difference]: Start difference. First operand 373 states and 534 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:24:00,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:00,578 INFO L93 Difference]: Finished difference Result 704 states and 1013 transitions. [2024-11-16 14:24:00,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:24:00,579 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-16 14:24:00,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:00,583 INFO L225 Difference]: With dead ends: 704 [2024-11-16 14:24:00,584 INFO L226 Difference]: Without dead ends: 373 [2024-11-16 14:24:00,585 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-16 14:24:00,587 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 121 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:00,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 185 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:24:00,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2024-11-16 14:24:00,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 353. [2024-11-16 14:24:00,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 267 states have (on average 1.3295880149812733) internal successors, (355), 273 states have internal predecessors, (355), 74 states have call successors, (74), 11 states have call predecessors, (74), 11 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-16 14:24:00,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 503 transitions. [2024-11-16 14:24:00,671 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 503 transitions. Word has length 167 [2024-11-16 14:24:00,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:00,674 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 503 transitions. [2024-11-16 14:24:00,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:24:00,675 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 503 transitions. [2024-11-16 14:24:00,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 14:24:00,678 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:00,678 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:00,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 14:24:00,679 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:00,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:00,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2023106374, now seen corresponding path program 1 times [2024-11-16 14:24:00,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:00,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195034570] [2024-11-16 14:24:00,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:00,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:24:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:24:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:24:01,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:24:01,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:24:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:24:01,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:24:01,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:24:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:24:01,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:24:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:24:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:24:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:24:01,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:24:01,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:24:01,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:24:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:24:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:24:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:24:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:24:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:24:01,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:24:01,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:24:01,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:24:01,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:01,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:24:01,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:24:01,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195034570] [2024-11-16 14:24:01,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195034570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:24:01,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:24:01,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 14:24:01,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172964039] [2024-11-16 14:24:01,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:24:01,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 14:24:01,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:24:01,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 14:24:01,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-16 14:24:01,553 INFO L87 Difference]: Start difference. First operand 353 states and 503 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:24:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:02,710 INFO L93 Difference]: Finished difference Result 1296 states and 1828 transitions. [2024-11-16 14:24:02,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 14:24:02,711 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 167 [2024-11-16 14:24:02,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:02,716 INFO L225 Difference]: With dead ends: 1296 [2024-11-16 14:24:02,717 INFO L226 Difference]: Without dead ends: 985 [2024-11-16 14:24:02,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=113, Unknown=0, NotChecked=0, Total=182 [2024-11-16 14:24:02,718 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 611 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 611 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:02,719 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [611 Valid, 523 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-16 14:24:02,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 985 states. [2024-11-16 14:24:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 985 to 709. [2024-11-16 14:24:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 545 states have (on average 1.3357798165137615) internal successors, (728), 557 states have internal predecessors, (728), 143 states have call successors, (143), 20 states have call predecessors, (143), 20 states have return successors, (143), 131 states have call predecessors, (143), 143 states have call successors, (143) [2024-11-16 14:24:02,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 1014 transitions. [2024-11-16 14:24:02,853 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 1014 transitions. Word has length 167 [2024-11-16 14:24:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:02,853 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 1014 transitions. [2024-11-16 14:24:02,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:24:02,854 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 1014 transitions. [2024-11-16 14:24:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 14:24:02,856 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:02,856 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:02,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 14:24:02,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:02,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:02,857 INFO L85 PathProgramCache]: Analyzing trace with hash -529050587, now seen corresponding path program 1 times [2024-11-16 14:24:02,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:02,857 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250475410] [2024-11-16 14:24:02,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:02,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:02,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:24:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:24:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:24:04,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:24:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:24:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:24:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:24:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:24:04,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:24:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:24:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:24:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:24:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:24:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:24:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:24:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:24:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:24:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:24:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:24:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:24:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:24:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:24:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:24:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:24:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:24:04,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:24:04,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250475410] [2024-11-16 14:24:04,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250475410] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:24:04,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937780326] [2024-11-16 14:24:04,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:04,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:24:04,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:24:04,268 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-16 14:24:04,270 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-16 14:24:04,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:04,507 INFO L255 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 34 conjuncts are in the unsatisfiable core [2024-11-16 14:24:04,527 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:24:05,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 743 proven. 129 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-16 14:24:05,945 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:24:06,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-16 14:24:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937780326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:24:06,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:24:06,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 21, 14] total 42 [2024-11-16 14:24:06,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202795720] [2024-11-16 14:24:06,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:24:06,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-16 14:24:06,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:24:06,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-16 14:24:06,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1381, Unknown=0, NotChecked=0, Total=1722 [2024-11-16 14:24:06,810 INFO L87 Difference]: Start difference. First operand 709 states and 1014 transitions. Second operand has 42 states, 40 states have (on average 3.5) internal successors, (140), 40 states have internal predecessors, (140), 9 states have call successors, (57), 5 states have call predecessors, (57), 10 states have return successors, (58), 8 states have call predecessors, (58), 9 states have call successors, (58) [2024-11-16 14:24:19,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:19,430 INFO L93 Difference]: Finished difference Result 2617 states and 3455 transitions. [2024-11-16 14:24:19,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 184 states. [2024-11-16 14:24:19,430 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 3.5) internal successors, (140), 40 states have internal predecessors, (140), 9 states have call successors, (57), 5 states have call predecessors, (57), 10 states have return successors, (58), 8 states have call predecessors, (58), 9 states have call successors, (58) Word has length 167 [2024-11-16 14:24:19,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:19,442 INFO L225 Difference]: With dead ends: 2617 [2024-11-16 14:24:19,442 INFO L226 Difference]: Without dead ends: 1950 [2024-11-16 14:24:19,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 605 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16491 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=7906, Invalid=38104, Unknown=0, NotChecked=0, Total=46010 [2024-11-16 14:24:19,458 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 1920 mSDsluCounter, 2971 mSDsCounter, 0 mSdLazyCounter, 4768 mSolverCounterSat, 787 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1923 SdHoareTripleChecker+Valid, 3155 SdHoareTripleChecker+Invalid, 5555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 787 IncrementalHoareTripleChecker+Valid, 4768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:19,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1923 Valid, 3155 Invalid, 5555 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [787 Valid, 4768 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-16 14:24:19,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2024-11-16 14:24:19,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 687. [2024-11-16 14:24:19,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 550 states have (on average 1.2581818181818183) internal successors, (692), 562 states have internal predecessors, (692), 102 states have call successors, (102), 34 states have call predecessors, (102), 34 states have return successors, (102), 90 states have call predecessors, (102), 102 states have call successors, (102) [2024-11-16 14:24:19,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 896 transitions. [2024-11-16 14:24:19,635 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 896 transitions. Word has length 167 [2024-11-16 14:24:19,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:19,636 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 896 transitions. [2024-11-16 14:24:19,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 3.5) internal successors, (140), 40 states have internal predecessors, (140), 9 states have call successors, (57), 5 states have call predecessors, (57), 10 states have return successors, (58), 8 states have call predecessors, (58), 9 states have call successors, (58) [2024-11-16 14:24:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 896 transitions. [2024-11-16 14:24:19,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-16 14:24:19,639 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:19,640 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:19,659 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-16 14:24:19,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:24:19,842 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:19,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:19,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1590644454, now seen corresponding path program 1 times [2024-11-16 14:24:19,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:19,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843448406] [2024-11-16 14:24:19,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:19,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:24:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:24:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:24:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:24:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:24:19,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:24:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:24:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:24:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:24:19,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:24:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:24:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:24:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:24:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:24:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:19,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:24:20,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:24:20,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:24:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:24:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:24:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:24:20,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:24:20,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:24:20,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:24:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:24:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:24:20,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:24:20,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843448406] [2024-11-16 14:24:20,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843448406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:24:20,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:24:20,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:24:20,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48959380] [2024-11-16 14:24:20,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:24:20,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:24:20,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:24:20,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:24:20,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:24:20,019 INFO L87 Difference]: Start difference. First operand 687 states and 896 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:24:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:20,163 INFO L93 Difference]: Finished difference Result 1257 states and 1636 transitions. [2024-11-16 14:24:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:24:20,164 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 167 [2024-11-16 14:24:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:20,168 INFO L225 Difference]: With dead ends: 1257 [2024-11-16 14:24:20,168 INFO L226 Difference]: Without dead ends: 573 [2024-11-16 14:24:20,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 50 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-16 14:24:20,171 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 49 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:20,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 450 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 14:24:20,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2024-11-16 14:24:20,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 491. [2024-11-16 14:24:20,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 381 states have (on average 1.2414698162729658) internal successors, (473), 384 states have internal predecessors, (473), 81 states have call successors, (81), 28 states have call predecessors, (81), 28 states have return successors, (81), 78 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-16 14:24:20,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 635 transitions. [2024-11-16 14:24:20,258 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 635 transitions. Word has length 167 [2024-11-16 14:24:20,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:20,258 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 635 transitions. [2024-11-16 14:24:20,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:24:20,258 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 635 transitions. [2024-11-16 14:24:20,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 14:24:20,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:20,261 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:20,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 14:24:20,262 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:20,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1483549389, now seen corresponding path program 1 times [2024-11-16 14:24:20,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:20,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531424925] [2024-11-16 14:24:20,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:20,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 14:24:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 14:24:20,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 14:24:20,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 14:24:20,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 14:24:20,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-16 14:24:20,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-16 14:24:20,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-16 14:24:20,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-16 14:24:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-16 14:24:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-16 14:24:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 14:24:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-16 14:24:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 14:24:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-16 14:24:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 14:24:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-16 14:24:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 14:24:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-16 14:24:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 14:24:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-16 14:24:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-16 14:24:20,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-16 14:24:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-16 14:24:20,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:24:20,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 14:24:20,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531424925] [2024-11-16 14:24:20,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531424925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 14:24:20,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302857207] [2024-11-16 14:24:20,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:20,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:24:20,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:24:20,746 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-16 14:24:20,747 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-16 14:24:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:20,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 14:24:20,888 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:24:21,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 503 proven. 90 refuted. 0 times theorem prover too weak. 511 trivial. 0 not checked. [2024-11-16 14:24:21,231 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:24:21,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 42 proven. 93 refuted. 0 times theorem prover too weak. 969 trivial. 0 not checked. [2024-11-16 14:24:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302857207] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:24:21,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 14:24:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 19 [2024-11-16 14:24:21,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201316957] [2024-11-16 14:24:21,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 14:24:21,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-16 14:24:21,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 14:24:21,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-16 14:24:21,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2024-11-16 14:24:21,593 INFO L87 Difference]: Start difference. First operand 491 states and 635 transitions. Second operand has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2024-11-16 14:24:22,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:22,293 INFO L93 Difference]: Finished difference Result 1415 states and 1774 transitions. [2024-11-16 14:24:22,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 14:24:22,294 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) Word has length 168 [2024-11-16 14:24:22,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:22,299 INFO L225 Difference]: With dead ends: 1415 [2024-11-16 14:24:22,299 INFO L226 Difference]: Without dead ends: 927 [2024-11-16 14:24:22,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=306, Invalid=624, Unknown=0, NotChecked=0, Total=930 [2024-11-16 14:24:22,301 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 398 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:22,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 428 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 14:24:22,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 927 states. [2024-11-16 14:24:22,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 927 to 489. [2024-11-16 14:24:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 379 states have (on average 1.229551451187335) internal successors, (466), 382 states have internal predecessors, (466), 81 states have call successors, (81), 28 states have call predecessors, (81), 28 states have return successors, (81), 78 states have call predecessors, (81), 81 states have call successors, (81) [2024-11-16 14:24:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 628 transitions. [2024-11-16 14:24:22,386 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 628 transitions. Word has length 168 [2024-11-16 14:24:22,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:22,386 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 628 transitions. [2024-11-16 14:24:22,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 6.294117647058823) internal successors, (107), 17 states have internal predecessors, (107), 7 states have call successors, (57), 3 states have call predecessors, (57), 6 states have return successors, (58), 6 states have call predecessors, (58), 7 states have call successors, (58) [2024-11-16 14:24:22,387 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 628 transitions. [2024-11-16 14:24:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-16 14:24:22,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:22,389 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:22,407 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-16 14:24:22,590 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,SelfDestructingSolverStorable10 [2024-11-16 14:24:22,591 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:22,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:22,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1783228895, now seen corresponding path program 1 times [2024-11-16 14:24:22,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 14:24:22,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590127735] [2024-11-16 14:24:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:22,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 14:24:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 14:24:22,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1253994226] [2024-11-16 14:24:22,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:22,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 14:24:22,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:24:22,709 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-16 14:24:22,710 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-16 14:24:22,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:24:22,870 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 14:24:22,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 14:24:23,044 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 14:24:23,046 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 14:24:23,047 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 14:24:23,068 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-16 14:24:23,253 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-16 14:24:23,257 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:23,379 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 14:24:23,382 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 02:24:23 BoogieIcfgContainer [2024-11-16 14:24:23,382 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 14:24:23,383 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 14:24:23,383 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 14:24:23,383 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 14:24:23,384 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:23:55" (3/4) ... [2024-11-16 14:24:23,386 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 14:24:23,387 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 14:24:23,387 INFO L158 Benchmark]: Toolchain (without parser) took 29333.38ms. Allocated memory was 142.6MB in the beginning and 482.3MB in the end (delta: 339.7MB). Free memory was 94.5MB in the beginning and 405.2MB in the end (delta: -310.7MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-11-16 14:24:23,388 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 142.6MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:24:23,388 INFO L158 Benchmark]: CACSL2BoogieTranslator took 404.31ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 76.3MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 14:24:23,388 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.46ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 71.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 14:24:23,388 INFO L158 Benchmark]: Boogie Preprocessor took 123.17ms. Allocated memory was 142.6MB in the beginning and 190.8MB in the end (delta: 48.2MB). Free memory was 71.4MB in the beginning and 155.6MB in the end (delta: -84.2MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. [2024-11-16 14:24:23,389 INFO L158 Benchmark]: IcfgBuilder took 671.27ms. Allocated memory is still 190.8MB. Free memory was 155.6MB in the beginning and 125.2MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-16 14:24:23,389 INFO L158 Benchmark]: TraceAbstraction took 28059.99ms. Allocated memory was 190.8MB in the beginning and 482.3MB in the end (delta: 291.5MB). Free memory was 125.2MB in the beginning and 405.2MB in the end (delta: -280.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. [2024-11-16 14:24:23,390 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 482.3MB. Free memory is still 405.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 14:24:23,391 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.17ms. Allocated memory is still 142.6MB. Free memory is still 118.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 404.31ms. Allocated memory is still 142.6MB. Free memory was 94.3MB in the beginning and 76.3MB in the end (delta: 17.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.46ms. Allocated memory is still 142.6MB. Free memory was 76.3MB in the beginning and 71.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 123.17ms. Allocated memory was 142.6MB in the beginning and 190.8MB in the end (delta: 48.2MB). Free memory was 71.4MB in the beginning and 155.6MB in the end (delta: -84.2MB). Peak memory consumption was 13.1MB. Max. memory is 16.1GB. * IcfgBuilder took 671.27ms. Allocated memory is still 190.8MB. Free memory was 155.6MB in the beginning and 125.2MB in the end (delta: 30.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 28059.99ms. Allocated memory was 190.8MB in the beginning and 482.3MB in the end (delta: 291.5MB). Free memory was 125.2MB in the beginning and 405.2MB in the end (delta: -280.0MB). Peak memory consumption was 11.5MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 482.3MB. Free memory is still 405.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 169, overapproximation of someUnaryDOUBLEoperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someBinaryArithmeticFLOAToperation at line 57, overapproximation of someUnaryFLOAToperation at line 57. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L23] unsigned char var_1_7 = 0; [L24] unsigned char var_1_8 = 1; [L25] signed short int var_1_9 = -2; [L26] float var_1_13 = 999.4; [L27] float var_1_14 = 100.425; [L28] float var_1_15 = 3.375; [L29] float var_1_16 = 15.9; [L30] signed short int var_1_17 = -10; [L31] signed short int var_1_18 = 18060; [L32] unsigned char var_1_20 = 0; [L33] unsigned long int var_1_21 = 4; [L34] unsigned char var_1_23 = 0; [L35] unsigned char var_1_24 = 0; [L36] unsigned char var_1_25 = 100; [L37] unsigned char var_1_26 = 32; [L38] unsigned char var_1_27 = 10; [L39] unsigned char var_1_28 = 1; [L40] unsigned short int var_1_29 = 256; [L41] unsigned char var_1_30 = 1; [L42] unsigned char var_1_31 = 4; [L43] double var_1_33 = 31.625; [L44] double var_1_36 = 15.75; [L45] double var_1_37 = 15.375; [L46] unsigned short int var_1_38 = 16; [L47] unsigned char var_1_39 = 0; [L48] double var_1_44 = 128.5; [L49] float var_1_45 = 1.85; [L50] double var_1_46 = 1.5; [L51] double var_1_47 = 99999999999.4; [L52] unsigned char var_1_49 = 128; VAL [isInitial=0, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=0, var_1_8=1, var_1_9=-2] [L173] isInitial = 1 [L174] FCALL initially() [L175] COND TRUE 1 [L176] FCALL updateLastVariables() [L177] CALL updateVariables() [L126] var_1_7 = __VERIFIER_nondet_uchar() [L127] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L127] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L128] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L129] var_1_8 = __VERIFIER_nondet_uchar() [L130] CALL assume_abort_if_not(var_1_8 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L130] RET assume_abort_if_not(var_1_8 >= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L131] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, var_1_13=4997/5, var_1_14=4017/40, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L132] var_1_14 = __VERIFIER_nondet_float() [L133] CALL assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L133] RET assume_abort_if_not((var_1_14 >= -461168.6018427382800e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_15=27/8, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L134] var_1_15 = __VERIFIER_nondet_float() [L135] CALL assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L135] RET assume_abort_if_not((var_1_15 >= -461168.6018427382800e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 4611686.018427382800e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_16=159/10, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L136] var_1_16 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L137] RET assume_abort_if_not((var_1_16 >= -922337.2036854765600e+13F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=18060, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L138] var_1_18 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_18 >= 16382) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L139] RET assume_abort_if_not(var_1_18 >= 16382) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] CALL assume_abort_if_not(var_1_18 <= 32766) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L140] RET assume_abort_if_not(var_1_18 <= 32766) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=4, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L141] var_1_21 = __VERIFIER_nondet_ulong() [L142] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L142] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] CALL assume_abort_if_not(var_1_21 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L143] RET assume_abort_if_not(var_1_21 <= 4294967295) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] CALL assume_abort_if_not(var_1_21 != 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L144] RET assume_abort_if_not(var_1_21 != 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L145] var_1_23 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L146] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L147] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L148] var_1_24 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L149] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] CALL assume_abort_if_not(var_1_24 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L150] RET assume_abort_if_not(var_1_24 <= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=32, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L151] var_1_26 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L152] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L153] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=10, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L154] var_1_27 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_27 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L155] RET assume_abort_if_not(var_1_27 >= 0) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] CALL assume_abort_if_not(var_1_27 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L156] RET assume_abort_if_not(var_1_27 <= 127) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=63/4, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L157] var_1_36 = __VERIFIER_nondet_double() [L158] CALL assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L158] RET assume_abort_if_not((var_1_36 >= 0.0F && var_1_36 <= -1.0e-20F) || (var_1_36 <= 9223372.036854765600e+12F && var_1_36 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_37=123/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L159] var_1_37 = __VERIFIER_nondet_double() [L160] CALL assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L160] RET assume_abort_if_not((var_1_37 >= 0.0F && var_1_37 <= -1.0e-20F) || (var_1_37 <= 9223372.036854765600e+12F && var_1_37 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_46=3/2, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L161] var_1_46 = __VERIFIER_nondet_double() [L162] CALL assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L162] RET assume_abort_if_not((var_1_46 >= 0.0F && var_1_46 <= -1.0e-20F) || (var_1_46 <= 9223372.036854776000e+12F && var_1_46 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_47=499999999997/5, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L163] var_1_47 = __VERIFIER_nondet_double() [L164] CALL assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L164] RET assume_abort_if_not((var_1_47 >= 0.0F && var_1_47 <= -1.0e-20F) || (var_1_47 <= 9223372.036854776000e+12F && var_1_47 >= 1.0e-20F )) VAL [isInitial=1, var_1_13=4997/5, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L177] RET updateVariables() [L178] CALL step() [L56] COND TRUE \read(var_1_8) [L57] var_1_13 = (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=100, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L59] COND TRUE \read(var_1_8) [L60] var_1_25 = (var_1_26 + var_1_27) VAL [isInitial=1, var_1_13=2, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=37/20, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L62] COND FALSE !((var_1_16 * (var_1_46 - var_1_47)) < var_1_15) [L67] var_1_45 = (((((((((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) < (var_1_37)) ? (((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) : (var_1_37))) < 0 ) ? -((((((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) < (var_1_37)) ? (((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) : (var_1_37))) : ((((((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) < (var_1_37)) ? (((((var_1_15) > (var_1_36)) ? (var_1_15) : (var_1_36)))) : (var_1_37))))) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=256, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=16, var_1_39=0, var_1_44=257/2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L69] var_1_29 = var_1_27 [L70] var_1_38 = ((((var_1_26) > (var_1_27)) ? (var_1_26) : (var_1_27))) [L71] var_1_30 = var_1_8 VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=-2] [L72] COND FALSE !((var_1_29 > var_1_25) && var_1_30) [L75] var_1_9 = ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=-10, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=4, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L77] var_1_31 = var_1_26 [L78] var_1_17 = ((var_1_18 - 25) - var_1_25) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=257/2, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L79] COND FALSE !(var_1_36 <= var_1_14) [L84] var_1_44 = var_1_36 VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L86] signed long int stepLocal_2 = var_1_25 + var_1_17; VAL [isInitial=1, stepLocal_2=16357, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L87] COND TRUE ((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < stepLocal_2 [L88] var_1_20 = (var_1_23 || var_1_24) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L92] EXPR var_1_29 & (var_1_18 + 2u) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L92] EXPR 16u >> var_1_26 VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=0, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L92] COND TRUE (var_1_29 & (var_1_18 + 2u)) < (16u >> var_1_26) [L93] var_1_39 = ((var_1_7 && (var_1_8 && var_1_7)) && (! var_1_23)) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L95] signed short int stepLocal_3 = var_1_9; VAL [isInitial=1, stepLocal_3=0, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L96] COND FALSE !((~ var_1_29) > stepLocal_3) [L99] var_1_28 = (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L101] COND FALSE !(! var_1_8) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L104] var_1_8 || (var_1_27 >= (var_1_25 & var_1_18)) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=128, var_1_7=1, var_1_8=1, var_1_9=0] [L104] COND TRUE var_1_8 || (var_1_27 >= (var_1_25 & var_1_18)) [L105] COND FALSE !(-2 > var_1_18) [L108] var_1_49 = var_1_27 VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L111] signed long int stepLocal_1 = (((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25)); [L112] unsigned char stepLocal_0 = var_1_25; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L113] COND TRUE stepLocal_1 <= (var_1_25 - var_1_25) VAL [isInitial=1, stepLocal_0=0, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L114] COND FALSE !(stepLocal_0 < var_1_25) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L178] RET step() [L179] CALL, EXPR property() [L169-L170] return (((((((((((((var_1_9) > (var_1_25)) ? (var_1_9) : (var_1_25))) <= (var_1_25 - var_1_25)) ? ((var_1_25 < var_1_25) ? (var_1_20 ? (var_1_1 == ((unsigned char) var_1_7)) : (var_1_1 == ((unsigned char) var_1_8))) : 1) : (var_1_1 == ((unsigned char) 0))) && (((var_1_29 > var_1_25) && var_1_30) ? (var_1_9 == ((signed short int) var_1_25)) : (var_1_9 == ((signed short int) ((((var_1_25) > ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25))))) ? (var_1_25) : ((((((var_1_25 - 10)) < (var_1_25)) ? ((var_1_25 - 10)) : (var_1_25)))))))))) && (var_1_8 ? (var_1_13 == ((float) (((((var_1_14 + var_1_15)) < (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16))))) ? ((var_1_14 + var_1_15)) : (((((-0.2f) < (var_1_16)) ? (-0.2f) : (var_1_16)))))))) : 1)) && (var_1_17 == ((signed short int) ((var_1_18 - 25) - var_1_25)))) && ((((var_1_18 % var_1_21) & ((((1u) < 0 ) ? -(1u) : (1u)))) < (var_1_25 + var_1_17)) ? (var_1_20 == ((unsigned char) (var_1_23 || var_1_24))) : (var_1_20 == ((unsigned char) var_1_7)))) && (var_1_8 ? (var_1_25 == ((unsigned char) (var_1_26 + var_1_27))) : 1)) && (((~ var_1_29) > var_1_9) ? (var_1_28 == ((unsigned char) (! var_1_7))) : (var_1_28 == ((unsigned char) (var_1_20 || ((! var_1_23) && (var_1_24 || var_1_7))))))) && (var_1_29 == ((unsigned short int) var_1_27))) && (var_1_30 == ((unsigned char) var_1_8)) ; VAL [\result=0, isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L179] RET, EXPR property() [L179] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_13=2, var_1_15=0, var_1_16=0, var_1_17=16357, var_1_18=16382, var_1_1=1, var_1_20=0, var_1_21=-4294967295, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=0, var_1_28=1, var_1_29=0, var_1_30=1, var_1_31=0, var_1_33=253/8, var_1_36=4, var_1_37=0, var_1_38=0, var_1_39=1, var_1_44=4, var_1_45=3, var_1_49=0, var_1_7=1, var_1_8=1, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 93 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 27.9s, OverallIterations: 12, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 16.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3897 SdHoareTripleChecker+Valid, 6.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3880 mSDsluCounter, 6409 SdHoareTripleChecker+Invalid, 5.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4754 mSDsCounter, 1253 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6326 IncrementalHoareTripleChecker+Invalid, 7579 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1253 mSolverCounterUnsat, 1655 mSDtfsCounter, 6326 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1530 GetRequests, 1256 SyntacticMatches, 0 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16675 ImplicationChecksByTransitivity, 9.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=709occurred in iteration=8, InterpolantAutomatonStates: 243, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 2459 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 8.0s InterpolantComputationTime, 2506 NumberOfCodeBlocks, 2506 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2490 ConstructedInterpolants, 0 QuantifiedInterpolants, 8291 SizeOfPredicates, 20 NumberOfNonLiveVariables, 791 ConjunctsInSsa, 46 ConjunctsInUnsatCore, 15 InterpolantComputations, 9 PerfectInterpolantSequences, 16059/16560 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-16 14:24:23,529 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_fillercode_fillercodestructure_filler-pr-ci_file-50.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 1aa5ccf491fa19757c49751a869c16c8e81ee57a7445aa2b11849a454021fdb2 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 14:24:25,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 14:24:25,690 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 14:24:25,697 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 14:24:25,697 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 14:24:25,730 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 14:24:25,731 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 14:24:25,731 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 14:24:25,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 14:24:25,733 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 14:24:25,734 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 14:24:25,734 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 14:24:25,735 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 14:24:25,735 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 14:24:25,735 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 14:24:25,736 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 14:24:25,736 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 14:24:25,738 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 14:24:25,738 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 14:24:25,739 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 14:24:25,739 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 14:24:25,739 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 14:24:25,740 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 14:24:25,740 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 14:24:25,740 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 14:24:25,740 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 14:24:25,741 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 14:24:25,741 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 14:24:25,741 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 14:24:25,741 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 14:24:25,742 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 14:24:25,742 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 14:24:25,742 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 14:24:25,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 14:24:25,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:24:25,746 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 14:24:25,747 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 14:24:25,747 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 14:24:25,747 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 14:24:25,748 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 14:24:25,748 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 14:24:25,748 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 14:24:25,748 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 14:24:25,748 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 14:24:25,749 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 -> 1aa5ccf491fa19757c49751a869c16c8e81ee57a7445aa2b11849a454021fdb2 [2024-11-16 14:24:26,096 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 14:24:26,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 14:24:26,121 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 14:24:26,123 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 14:24:26,123 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 14:24:26,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2024-11-16 14:24:27,544 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 14:24:27,757 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 14:24:27,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2024-11-16 14:24:27,773 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb44a392/731e35511bb54c2f89b37266b53546fd/FLAG86203c300 [2024-11-16 14:24:27,787 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fb44a392/731e35511bb54c2f89b37266b53546fd [2024-11-16 14:24:27,789 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 14:24:27,790 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 14:24:27,791 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 14:24:27,791 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 14:24:27,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 14:24:27,797 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:24:27" (1/1) ... [2024-11-16 14:24:27,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@692a9d5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:27, skipping insertion in model container [2024-11-16 14:24:27,798 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 02:24:27" (1/1) ... [2024-11-16 14:24:27,830 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 14:24:28,015 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_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2024-11-16 14:24:28,115 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:24:28,131 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 14:24:28,144 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_fillercode_fillercodestructure_filler-pr-ci_file-50.i[919,932] [2024-11-16 14:24:28,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 14:24:28,204 INFO L204 MainTranslator]: Completed translation [2024-11-16 14:24:28,205 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28 WrapperNode [2024-11-16 14:24:28,205 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 14:24:28,207 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 14:24:28,207 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 14:24:28,207 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 14:24:28,214 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (1/1) ... [2024-11-16 14:24:28,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (1/1) ... [2024-11-16 14:24:28,280 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 177 [2024-11-16 14:24:28,281 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 14:24:28,282 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 14:24:28,282 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 14:24:28,282 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 14:24:28,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (1/1) ... [2024-11-16 14:24:28,293 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (1/1) ... [2024-11-16 14:24:28,302 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (1/1) ... [2024-11-16 14:24:28,331 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-16 14:24:28,331 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (1/1) ... [2024-11-16 14:24:28,331 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (1/1) ... [2024-11-16 14:24:28,347 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (1/1) ... [2024-11-16 14:24:28,347 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (1/1) ... [2024-11-16 14:24:28,353 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (1/1) ... [2024-11-16 14:24:28,358 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (1/1) ... [2024-11-16 14:24:28,366 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 14:24:28,367 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 14:24:28,367 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 14:24:28,367 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 14:24:28,368 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (1/1) ... [2024-11-16 14:24:28,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 14:24:28,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 14:24:28,410 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-16 14:24:28,414 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-16 14:24:28,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 14:24:28,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 14:24:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 14:24:28,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 14:24:28,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 14:24:28,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 14:24:28,561 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 14:24:28,564 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 14:24:38,500 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 14:24:38,501 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 14:24:38,516 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 14:24:38,516 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 14:24:38,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:24:38 BoogieIcfgContainer [2024-11-16 14:24:38,517 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 14:24:38,522 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 14:24:38,522 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 14:24:38,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 14:24:38,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 02:24:27" (1/3) ... [2024-11-16 14:24:38,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b99b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:24:38, skipping insertion in model container [2024-11-16 14:24:38,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 02:24:28" (2/3) ... [2024-11-16 14:24:38,529 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19b99b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 02:24:38, skipping insertion in model container [2024-11-16 14:24:38,530 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 02:24:38" (3/3) ... [2024-11-16 14:24:38,531 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-50.i [2024-11-16 14:24:38,548 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 14:24:38,548 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 14:24:38,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 14:24:38,612 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;@5a06f2c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 14:24:38,612 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 14:24:38,617 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:24:38,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 14:24:38,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:38,637 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:38,637 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:38,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:38,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1427462014, now seen corresponding path program 1 times [2024-11-16 14:24:38,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:24:38,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022097637] [2024-11-16 14:24:38,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:38,663 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-16 14:24:38,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:24:38,666 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-16 14:24:38,668 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-16 14:24:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:39,298 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 14:24:39,308 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:24:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 754 trivial. 0 not checked. [2024-11-16 14:24:39,363 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:24:39,364 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:24:39,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022097637] [2024-11-16 14:24:39,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2022097637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:24:39,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:24:39,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 14:24:39,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816376915] [2024-11-16 14:24:39,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:24:39,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 14:24:39,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:24:39,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 14:24:39,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:24:39,399 INFO L87 Difference]: Start difference. First operand has 82 states, 55 states have (on average 1.3818181818181818) internal successors, (76), 56 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:24:39,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:39,435 INFO L93 Difference]: Finished difference Result 156 states and 265 transitions. [2024-11-16 14:24:39,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 14:24:39,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 162 [2024-11-16 14:24:39,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:39,450 INFO L225 Difference]: With dead ends: 156 [2024-11-16 14:24:39,451 INFO L226 Difference]: Without dead ends: 77 [2024-11-16 14:24:39,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 14:24:39,460 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:39,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 14:24:39,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-16 14:24:39,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-16 14:24:39,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.3333333333333333) internal successors, (68), 51 states have internal predecessors, (68), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:24:39,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 116 transitions. [2024-11-16 14:24:39,503 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 116 transitions. Word has length 162 [2024-11-16 14:24:39,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:39,503 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 116 transitions. [2024-11-16 14:24:39,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-16 14:24:39,504 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 116 transitions. [2024-11-16 14:24:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-16 14:24:39,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:39,510 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:39,540 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-16 14:24:39,711 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-16 14:24:39,712 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:39,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:39,713 INFO L85 PathProgramCache]: Analyzing trace with hash -981048736, now seen corresponding path program 1 times [2024-11-16 14:24:39,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:24:39,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818978316] [2024-11-16 14:24:39,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:39,715 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-16 14:24:39,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:24:39,717 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-16 14:24:39,736 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-16 14:24:40,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:40,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 14:24:40,338 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:24:42,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 195 proven. 63 refuted. 0 times theorem prover too weak. 846 trivial. 0 not checked. [2024-11-16 14:24:42,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:24:43,658 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:24:43,658 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:24:43,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818978316] [2024-11-16 14:24:43,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818978316] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:24:43,660 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:24:43,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-11-16 14:24:43,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136507717] [2024-11-16 14:24:43,660 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:24:43,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 14:24:43,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:24:43,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 14:24:43,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 14:24:43,666 INFO L87 Difference]: Start difference. First operand 77 states and 116 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-16 14:24:44,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:44,947 INFO L93 Difference]: Finished difference Result 157 states and 234 transitions. [2024-11-16 14:24:44,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 14:24:44,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 162 [2024-11-16 14:24:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:44,951 INFO L225 Difference]: With dead ends: 157 [2024-11-16 14:24:44,951 INFO L226 Difference]: Without dead ends: 83 [2024-11-16 14:24:44,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 316 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-16 14:24:44,954 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 71 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:44,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 188 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 14:24:44,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-16 14:24:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 81. [2024-11-16 14:24:44,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2407407407407407) internal successors, (67), 54 states have internal predecessors, (67), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:24:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2024-11-16 14:24:44,975 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 162 [2024-11-16 14:24:44,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:44,976 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2024-11-16 14:24:44,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2024-11-16 14:24:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2024-11-16 14:24:44,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-16 14:24:44,979 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:44,979 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:44,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 14:24:45,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:24:45,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:45,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:45,181 INFO L85 PathProgramCache]: Analyzing trace with hash 419754080, now seen corresponding path program 1 times [2024-11-16 14:24:45,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:24:45,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [598032686] [2024-11-16 14:24:45,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:45,182 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-16 14:24:45,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:24:45,184 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:24:45,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 14:24:45,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:45,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-16 14:24:45,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:24:45,943 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-16 14:24:45,943 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 14:24:45,943 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:24:45,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [598032686] [2024-11-16 14:24:45,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [598032686] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 14:24:45,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 14:24:45,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 14:24:45,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104382628] [2024-11-16 14:24:45,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 14:24:45,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 14:24:45,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:24:45,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 14:24:45,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 14:24:45,946 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:24:46,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:46,294 INFO L93 Difference]: Finished difference Result 215 states and 308 transitions. [2024-11-16 14:24:46,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 14:24:46,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 163 [2024-11-16 14:24:46,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:46,297 INFO L225 Difference]: With dead ends: 215 [2024-11-16 14:24:46,297 INFO L226 Difference]: Without dead ends: 137 [2024-11-16 14:24:46,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 14:24:46,299 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 101 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:46,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 446 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 14:24:46,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-16 14:24:46,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 81. [2024-11-16 14:24:46,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 54 states have (on average 1.2222222222222223) internal successors, (66), 54 states have internal predecessors, (66), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:24:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 114 transitions. [2024-11-16 14:24:46,318 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 114 transitions. Word has length 163 [2024-11-16 14:24:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:46,319 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 114 transitions. [2024-11-16 14:24:46,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2024-11-16 14:24:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2024-11-16 14:24:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-16 14:24:46,321 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:46,322 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:46,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 14:24:46,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:24:46,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:46,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:46,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1377197279, now seen corresponding path program 1 times [2024-11-16 14:24:46,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:24:46,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [274805793] [2024-11-16 14:24:46,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:46,525 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-16 14:24:46,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:24:46,528 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:24:46,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 14:24:46,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:47,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 14:24:47,015 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 14:24:48,347 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 485 proven. 48 refuted. 0 times theorem prover too weak. 571 trivial. 0 not checked. [2024-11-16 14:24:48,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 14:24:49,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 21 proven. 48 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-16 14:24:49,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 14:24:49,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [274805793] [2024-11-16 14:24:49,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [274805793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 14:24:49,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 14:24:49,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 14:24:49,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539027777] [2024-11-16 14:24:49,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 14:24:49,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 14:24:49,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 14:24:49,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 14:24:49,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-16 14:24:49,678 INFO L87 Difference]: Start difference. First operand 81 states and 114 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-16 14:24:51,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 14:24:51,124 INFO L93 Difference]: Finished difference Result 165 states and 230 transitions. [2024-11-16 14:24:51,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 14:24:51,135 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) Word has length 163 [2024-11-16 14:24:51,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 14:24:51,137 INFO L225 Difference]: With dead ends: 165 [2024-11-16 14:24:51,137 INFO L226 Difference]: Without dead ends: 87 [2024-11-16 14:24:51,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 318 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-11-16 14:24:51,140 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 107 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-16 14:24:51,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 179 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-16 14:24:51,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-11-16 14:24:51,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2024-11-16 14:24:51,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 57 states have internal predecessors, (68), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-16 14:24:51,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 116 transitions. [2024-11-16 14:24:51,158 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 116 transitions. Word has length 163 [2024-11-16 14:24:51,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 14:24:51,159 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 116 transitions. [2024-11-16 14:24:51,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 3 states have call successors, (40), 2 states have call predecessors, (40), 4 states have return successors, (41), 3 states have call predecessors, (41), 3 states have call successors, (41) [2024-11-16 14:24:51,159 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 116 transitions. [2024-11-16 14:24:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-16 14:24:51,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 14:24:51,161 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 14:24:51,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 14:24:51,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 14:24:51,362 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 14:24:51,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 14:24:51,363 INFO L85 PathProgramCache]: Analyzing trace with hash 365613056, now seen corresponding path program 1 times [2024-11-16 14:24:51,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 14:24:51,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1917217553] [2024-11-16 14:24:51,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 14:24:51,364 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-16 14:24:51,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 14:24:51,367 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 14:24:51,368 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 14:24:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 14:24:51,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-16 14:24:51,907 INFO L278 TraceCheckSpWp]: Computing forward predicates...