./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.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 925e9b76051eff442eff54c72fd139be6e9d1af6b77433b45103df887e08e16e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:20:51,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:20:51,140 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 02:20:51,145 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:20:51,146 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:20:51,180 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:20:51,181 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:20:51,181 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:20:51,182 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:20:51,183 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:20:51,184 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:20:51,184 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:20:51,185 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:20:51,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:20:51,187 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:20:51,187 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:20:51,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:20:51,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:20:51,188 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 02:20:51,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:20:51,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:20:51,193 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:20:51,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:20:51,193 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:20:51,194 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:20:51,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:20:51,194 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:20:51,195 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:20:51,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:20:51,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:20:51,196 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:20:51,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:20:51,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:20:51,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:20:51,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:20:51,209 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:20:51,209 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 02:20:51,209 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 02:20:51,209 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:20:51,210 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:20:51,210 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:20:51,210 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:20:51,211 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 -> 925e9b76051eff442eff54c72fd139be6e9d1af6b77433b45103df887e08e16e [2024-11-20 02:20:51,472 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:20:51,499 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:20:51,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:20:51,505 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:20:51,505 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:20:51,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i [2024-11-20 02:20:52,995 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:20:53,211 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:20:53,212 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i [2024-11-20 02:20:53,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5fabc67/7d4f1375b94d44beb9f08441437eb75f/FLAG334d22269 [2024-11-20 02:20:53,237 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b5fabc67/7d4f1375b94d44beb9f08441437eb75f [2024-11-20 02:20:53,240 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:20:53,243 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:20:53,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:20:53,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:20:53,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:20:53,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,255 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@f8ce61d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53, skipping insertion in model container [2024-11-20 02:20:53,255 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:20:53,478 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_codestructure_dependencies_file-84.i[919,932] [2024-11-20 02:20:53,536 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:20:53,548 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:20:53,559 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_codestructure_dependencies_file-84.i[919,932] [2024-11-20 02:20:53,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:20:53,616 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:20:53,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53 WrapperNode [2024-11-20 02:20:53,621 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:20:53,622 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:20:53,622 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:20:53,622 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:20:53,630 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,679 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2024-11-20 02:20:53,680 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:20:53,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:20:53,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:20:53,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:20:53,692 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,692 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,695 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,715 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-20 02:20:53,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,728 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,732 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,735 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,736 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,744 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:20:53,745 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:20:53,745 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:20:53,745 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:20:53,746 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (1/1) ... [2024-11-20 02:20:53,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:20:53,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:20:53,783 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-20 02:20:53,788 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-20 02:20:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:20:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:20:53,828 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:20:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 02:20:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:20:53,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:20:53,894 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:20:53,896 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:20:54,315 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-11-20 02:20:54,315 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:20:54,329 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:20:54,329 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:20:54,330 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:20:54 BoogieIcfgContainer [2024-11-20 02:20:54,330 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:20:54,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:20:54,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:20:54,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:20:54,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:20:53" (1/3) ... [2024-11-20 02:20:54,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2645ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:20:54, skipping insertion in model container [2024-11-20 02:20:54,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:20:53" (2/3) ... [2024-11-20 02:20:54,338 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2645ff8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:20:54, skipping insertion in model container [2024-11-20 02:20:54,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:20:54" (3/3) ... [2024-11-20 02:20:54,339 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-84.i [2024-11-20 02:20:54,354 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:20:54,355 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:20:54,413 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:20:54,419 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;@56bcbba5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:20:54,419 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:20:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:20:54,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 02:20:54,440 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:20:54,440 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:20:54,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:20:54,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:20:54,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1829916941, now seen corresponding path program 1 times [2024-11-20 02:20:54,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:20:54,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567177038] [2024-11-20 02:20:54,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:20:54,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:20:54,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:20:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:20:54,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:20:54,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:20:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:20:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:20:54,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:20:54,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:20:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:20:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:20:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:20:54,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:20:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:20:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:20:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:20:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:20:54,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:20:54,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:20:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:20:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:20:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:20:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:20:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:54,973 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:20:54,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:20:54,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567177038] [2024-11-20 02:20:54,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567177038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:20:54,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:20:54,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:20:54,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118995558] [2024-11-20 02:20:54,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:20:54,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:20:54,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:20:55,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:20:55,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:20:55,008 INFO L87 Difference]: Start difference. First operand has 78 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 54 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 02:20:55,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:20:55,039 INFO L93 Difference]: Finished difference Result 149 states and 256 transitions. [2024-11-20 02:20:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:20:55,042 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 142 [2024-11-20 02:20:55,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:20:55,050 INFO L225 Difference]: With dead ends: 149 [2024-11-20 02:20:55,051 INFO L226 Difference]: Without dead ends: 74 [2024-11-20 02:20:55,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:20:55,057 INFO L432 NwaCegarLoop]: 113 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, 113 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-20 02:20:55,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:20:55,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-20 02:20:55,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-20 02:20:55,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:20:55,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 113 transitions. [2024-11-20 02:20:55,111 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 113 transitions. Word has length 142 [2024-11-20 02:20:55,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:20:55,112 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 113 transitions. [2024-11-20 02:20:55,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 02:20:55,113 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 113 transitions. [2024-11-20 02:20:55,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 02:20:55,116 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:20:55,116 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:20:55,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 02:20:55,117 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:20:55,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:20:55,118 INFO L85 PathProgramCache]: Analyzing trace with hash 907536563, now seen corresponding path program 1 times [2024-11-20 02:20:55,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:20:55,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919408426] [2024-11-20 02:20:55,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:20:55,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:20:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:20:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:20:55,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:20:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:20:55,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:20:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:20:55,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:20:55,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:20:55,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:20:55,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:20:55,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:20:55,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:20:55,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:20:55,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:20:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:20:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:20:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:20:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:20:55,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:20:55,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:20:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:20:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:20:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:20:55,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:20:55,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919408426] [2024-11-20 02:20:55,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919408426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:20:55,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:20:55,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:20:55,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001225781] [2024-11-20 02:20:55,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:20:55,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:20:55,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:20:55,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:20:55,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:20:55,718 INFO L87 Difference]: Start difference. First operand 74 states and 113 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:20:55,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:20:55,760 INFO L93 Difference]: Finished difference Result 145 states and 223 transitions. [2024-11-20 02:20:55,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:20:55,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-11-20 02:20:55,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:20:55,764 INFO L225 Difference]: With dead ends: 145 [2024-11-20 02:20:55,765 INFO L226 Difference]: Without dead ends: 74 [2024-11-20 02:20:55,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:20:55,769 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 110 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 02:20:55,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 109 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:20:55,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-20 02:20:55,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-20 02:20:55,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:20:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 112 transitions. [2024-11-20 02:20:55,784 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 112 transitions. Word has length 142 [2024-11-20 02:20:55,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:20:55,786 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 112 transitions. [2024-11-20 02:20:55,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:20:55,787 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 112 transitions. [2024-11-20 02:20:55,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-20 02:20:55,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:20:55,790 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:20:55,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 02:20:55,790 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:20:55,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:20:55,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1608601141, now seen corresponding path program 1 times [2024-11-20 02:20:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:20:55,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598122767] [2024-11-20 02:20:55,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:20:55,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:20:55,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:20:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:20:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:20:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:20:58,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:20:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:20:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:20:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:20:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:20:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:20:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:20:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:20:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:20:58,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:20:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:20:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:20:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:20:58,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:20:58,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:20:58,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:20:58,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:20:58,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:20:58,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:20:58,895 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:20:58,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:20:58,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598122767] [2024-11-20 02:20:58,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598122767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:20:58,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:20:58,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:20:58,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182067349] [2024-11-20 02:20:58,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:20:58,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:20:58,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:20:58,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:20:58,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:20:58,901 INFO L87 Difference]: Start difference. First operand 74 states and 112 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:20:59,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:20:59,884 INFO L93 Difference]: Finished difference Result 179 states and 266 transitions. [2024-11-20 02:20:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:20:59,885 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 142 [2024-11-20 02:20:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:20:59,887 INFO L225 Difference]: With dead ends: 179 [2024-11-20 02:20:59,887 INFO L226 Difference]: Without dead ends: 108 [2024-11-20 02:20:59,888 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:20:59,891 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 69 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-20 02:20:59,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 285 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-20 02:20:59,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-20 02:20:59,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 105. [2024-11-20 02:20:59,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 77 states have internal predecessors, (102), 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-20 02:20:59,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 154 transitions. [2024-11-20 02:20:59,919 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 154 transitions. Word has length 142 [2024-11-20 02:20:59,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:20:59,919 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 154 transitions. [2024-11-20 02:20:59,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:20:59,920 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 154 transitions. [2024-11-20 02:20:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 02:20:59,925 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:20:59,925 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:20:59,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 02:20:59,926 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:20:59,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:20:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1401317031, now seen corresponding path program 1 times [2024-11-20 02:20:59,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:20:59,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093792235] [2024-11-20 02:20:59,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:20:59,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:20:59,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:00,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:21:00,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:00,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:21:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:21:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:21:00,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:21:00,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:21:00,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:21:00,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:21:00,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:21:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:21:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:21:00,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:00,965 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:21:00,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:00,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093792235] [2024-11-20 02:21:00,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093792235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:00,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:00,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:21:00,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492262463] [2024-11-20 02:21:00,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:00,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:21:00,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:00,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:21:00,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:21:00,968 INFO L87 Difference]: Start difference. First operand 105 states and 154 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:01,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:01,387 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2024-11-20 02:21:01,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:21:01,390 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-11-20 02:21:01,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:01,393 INFO L225 Difference]: With dead ends: 238 [2024-11-20 02:21:01,393 INFO L226 Difference]: Without dead ends: 136 [2024-11-20 02:21:01,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:21:01,397 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 34 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:01,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 395 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 02:21:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-20 02:21:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 133. [2024-11-20 02:21:01,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 101 states have (on average 1.3366336633663367) internal successors, (135), 103 states have internal predecessors, (135), 28 states have call successors, (28), 3 states have call predecessors, (28), 3 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:21:01,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 191 transitions. [2024-11-20 02:21:01,428 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 191 transitions. Word has length 143 [2024-11-20 02:21:01,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:01,428 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 191 transitions. [2024-11-20 02:21:01,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:01,429 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 191 transitions. [2024-11-20 02:21:01,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-20 02:21:01,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:01,434 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:01,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 02:21:01,434 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:01,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:01,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1988123045, now seen corresponding path program 1 times [2024-11-20 02:21:01,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:01,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442648455] [2024-11-20 02:21:01,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:01,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:01,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:01,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:01,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:01,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:01,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:01,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:21:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:21:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:21:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:21:01,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:21:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:21:01,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:21:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:21:01,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:21:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:21:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:21:01,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:21:01,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:01,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442648455] [2024-11-20 02:21:01,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442648455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:01,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:01,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:21:01,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976939978] [2024-11-20 02:21:01,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:01,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:21:01,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:01,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:21:01,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:21:01,973 INFO L87 Difference]: Start difference. First operand 133 states and 191 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:02,188 INFO L93 Difference]: Finished difference Result 279 states and 394 transitions. [2024-11-20 02:21:02,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:21:02,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2024-11-20 02:21:02,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:02,191 INFO L225 Difference]: With dead ends: 279 [2024-11-20 02:21:02,191 INFO L226 Difference]: Without dead ends: 149 [2024-11-20 02:21:02,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 02:21:02,192 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 64 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:02,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 308 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:21:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2024-11-20 02:21:02,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 117. [2024-11-20 02:21:02,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 84 states have (on average 1.2976190476190477) internal successors, (109), 86 states have internal predecessors, (109), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:21:02,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 165 transitions. [2024-11-20 02:21:02,213 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 165 transitions. Word has length 143 [2024-11-20 02:21:02,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:02,214 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 165 transitions. [2024-11-20 02:21:02,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:02,214 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 165 transitions. [2024-11-20 02:21:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-20 02:21:02,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:02,217 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:02,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 02:21:02,217 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:02,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:02,218 INFO L85 PathProgramCache]: Analyzing trace with hash -531695120, now seen corresponding path program 1 times [2024-11-20 02:21:02,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:02,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904879307] [2024-11-20 02:21:02,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:02,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:04,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:04,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:04,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:04,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:21:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:04,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:21:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:21:04,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:21:04,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:21:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:21:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:21:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:21:04,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:21:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:21:04,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:21:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:04,875 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:21:04,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:04,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904879307] [2024-11-20 02:21:04,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904879307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:04,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:04,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 02:21:04,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848157478] [2024-11-20 02:21:04,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:04,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 02:21:04,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:04,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 02:21:04,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-20 02:21:04,878 INFO L87 Difference]: Start difference. First operand 117 states and 165 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:05,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:05,449 INFO L93 Difference]: Finished difference Result 280 states and 398 transitions. [2024-11-20 02:21:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 02:21:05,451 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-11-20 02:21:05,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:05,453 INFO L225 Difference]: With dead ends: 280 [2024-11-20 02:21:05,453 INFO L226 Difference]: Without dead ends: 174 [2024-11-20 02:21:05,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:21:05,456 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 57 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:05,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 436 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 02:21:05,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-20 02:21:05,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 144. [2024-11-20 02:21:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 111 states have (on average 1.3333333333333333) internal successors, (148), 113 states have internal predecessors, (148), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:21:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 204 transitions. [2024-11-20 02:21:05,490 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 204 transitions. Word has length 144 [2024-11-20 02:21:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:05,491 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 204 transitions. [2024-11-20 02:21:05,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 204 transitions. [2024-11-20 02:21:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 02:21:05,494 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:05,494 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:05,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 02:21:05,495 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:05,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:05,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1480980205, now seen corresponding path program 1 times [2024-11-20 02:21:05,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:05,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471516437] [2024-11-20 02:21:05,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:05,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:05,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:05,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:05,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:05,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:05,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:05,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:05,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:21:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:05,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:21:05,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:21:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:05,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:21:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:21:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:21:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:21:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:21:05,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:21:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:21:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:21:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,619 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:21:05,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:05,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471516437] [2024-11-20 02:21:05,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471516437] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:05,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:05,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:21:05,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117801436] [2024-11-20 02:21:05,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:05,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:21:05,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:05,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:21:05,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:21:05,622 INFO L87 Difference]: Start difference. First operand 144 states and 204 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:05,730 INFO L93 Difference]: Finished difference Result 340 states and 480 transitions. [2024-11-20 02:21:05,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:21:05,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-20 02:21:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:05,733 INFO L225 Difference]: With dead ends: 340 [2024-11-20 02:21:05,733 INFO L226 Difference]: Without dead ends: 207 [2024-11-20 02:21:05,733 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:21:05,734 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 39 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:05,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 167 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:21:05,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2024-11-20 02:21:05,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 176. [2024-11-20 02:21:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 143 states have (on average 1.3426573426573427) internal successors, (192), 145 states have internal predecessors, (192), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-20 02:21:05,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 248 transitions. [2024-11-20 02:21:05,755 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 248 transitions. Word has length 145 [2024-11-20 02:21:05,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:05,755 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 248 transitions. [2024-11-20 02:21:05,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:05,756 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 248 transitions. [2024-11-20 02:21:05,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 02:21:05,757 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:05,757 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:05,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 02:21:05,758 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:05,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:05,758 INFO L85 PathProgramCache]: Analyzing trace with hash -1049328908, now seen corresponding path program 1 times [2024-11-20 02:21:05,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:05,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136615592] [2024-11-20 02:21:05,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:05,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:05,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:05,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:05,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:05,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:05,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:05,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:21:05,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:05,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:21:05,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:21:05,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:05,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:21:05,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:21:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:21:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:21:05,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:05,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:21:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:21:06,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:21:06,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:21:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:21:06,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:06,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136615592] [2024-11-20 02:21:06,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136615592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:06,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:06,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 02:21:06,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753198068] [2024-11-20 02:21:06,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:06,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 02:21:06,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:06,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 02:21:06,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 02:21:06,015 INFO L87 Difference]: Start difference. First operand 176 states and 248 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:06,202 INFO L93 Difference]: Finished difference Result 489 states and 690 transitions. [2024-11-20 02:21:06,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 02:21:06,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-20 02:21:06,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:06,206 INFO L225 Difference]: With dead ends: 489 [2024-11-20 02:21:06,206 INFO L226 Difference]: Without dead ends: 316 [2024-11-20 02:21:06,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-20 02:21:06,211 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 84 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:06,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 371 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:21:06,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-20 02:21:06,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 224. [2024-11-20 02:21:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 166 states have (on average 1.3012048192771084) internal successors, (216), 168 states have internal predecessors, (216), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-20 02:21:06,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 316 transitions. [2024-11-20 02:21:06,261 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 316 transitions. Word has length 145 [2024-11-20 02:21:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:06,262 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 316 transitions. [2024-11-20 02:21:06,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:06,262 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 316 transitions. [2024-11-20 02:21:06,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-20 02:21:06,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:06,264 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:06,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 02:21:06,265 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:06,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:06,265 INFO L85 PathProgramCache]: Analyzing trace with hash -941036026, now seen corresponding path program 1 times [2024-11-20 02:21:06,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:06,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218000903] [2024-11-20 02:21:06,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:06,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:06,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 02:21:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 02:21:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 02:21:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 02:21:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 02:21:06,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 02:21:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 02:21:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-20 02:21:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-20 02:21:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-20 02:21:06,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-20 02:21:06,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-20 02:21:06,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-20 02:21:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-20 02:21:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-20 02:21:06,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-20 02:21:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-20 02:21:06,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-20 02:21:06,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-20 02:21:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-20 02:21:06,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-20 02:21:06,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-20 02:21:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:06,372 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:21:06,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 02:21:06,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218000903] [2024-11-20 02:21:06,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218000903] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:06,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:06,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:21:06,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688019346] [2024-11-20 02:21:06,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:06,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:21:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 02:21:06,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:21:06,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:21:06,375 INFO L87 Difference]: Start difference. First operand 224 states and 316 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:06,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:06,492 INFO L93 Difference]: Finished difference Result 424 states and 591 transitions. [2024-11-20 02:21:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:21:06,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-11-20 02:21:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:06,497 INFO L225 Difference]: With dead ends: 424 [2024-11-20 02:21:06,498 INFO L226 Difference]: Without dead ends: 251 [2024-11-20 02:21:06,498 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:21:06,500 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:06,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 184 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:21:06,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-20 02:21:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 209. [2024-11-20 02:21:06,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 153 states have (on average 1.2875816993464053) internal successors, (197), 154 states have internal predecessors, (197), 48 states have call successors, (48), 7 states have call predecessors, (48), 7 states have return successors, (48), 47 states have call predecessors, (48), 48 states have call successors, (48) [2024-11-20 02:21:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 293 transitions. [2024-11-20 02:21:06,532 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 293 transitions. Word has length 145 [2024-11-20 02:21:06,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:06,532 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 293 transitions. [2024-11-20 02:21:06,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 293 transitions. [2024-11-20 02:21:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-20 02:21:06,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:06,534 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:06,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 02:21:06,534 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:06,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:06,535 INFO L85 PathProgramCache]: Analyzing trace with hash -692053077, now seen corresponding path program 1 times [2024-11-20 02:21:06,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 02:21:06,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009929522] [2024-11-20 02:21:06,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:06,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 02:21:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 02:21:06,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [44262068] [2024-11-20 02:21:06,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:06,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 02:21:06,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:21:06,595 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-20 02:21:06,598 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-20 02:21:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:21:06,953 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 02:21:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 02:21:07,162 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 02:21:07,163 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 02:21:07,164 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 02:21:07,176 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-20 02:21:07,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-20 02:21:07,370 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:07,474 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 02:21:07,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:21:07 BoogieIcfgContainer [2024-11-20 02:21:07,477 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 02:21:07,478 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 02:21:07,478 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 02:21:07,478 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 02:21:07,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:20:54" (3/4) ... [2024-11-20 02:21:07,481 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 02:21:07,482 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 02:21:07,483 INFO L158 Benchmark]: Toolchain (without parser) took 14239.57ms. Allocated memory was 184.5MB in the beginning and 339.7MB in the end (delta: 155.2MB). Free memory was 130.0MB in the beginning and 161.8MB in the end (delta: -31.8MB). Peak memory consumption was 125.5MB. Max. memory is 16.1GB. [2024-11-20 02:21:07,483 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 184.5MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:21:07,483 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.76ms. Allocated memory is still 184.5MB. Free memory was 129.5MB in the beginning and 113.6MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 02:21:07,484 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.83ms. Allocated memory is still 184.5MB. Free memory was 113.6MB in the beginning and 109.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:21:07,484 INFO L158 Benchmark]: Boogie Preprocessor took 63.92ms. Allocated memory is still 184.5MB. Free memory was 109.8MB in the beginning and 105.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 02:21:07,484 INFO L158 Benchmark]: RCFGBuilder took 585.12ms. Allocated memory is still 184.5MB. Free memory was 104.8MB in the beginning and 79.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 02:21:07,484 INFO L158 Benchmark]: TraceAbstraction took 13144.66ms. Allocated memory was 184.5MB in the beginning and 339.7MB in the end (delta: 155.2MB). Free memory was 78.8MB in the beginning and 161.8MB in the end (delta: -83.0MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. [2024-11-20 02:21:07,485 INFO L158 Benchmark]: Witness Printer took 4.50ms. Allocated memory is still 339.7MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 02:21:07,487 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.20ms. Allocated memory is still 184.5MB. Free memory is still 149.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.76ms. Allocated memory is still 184.5MB. Free memory was 129.5MB in the beginning and 113.6MB in the end (delta: 16.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.83ms. Allocated memory is still 184.5MB. Free memory was 113.6MB in the beginning and 109.8MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.92ms. Allocated memory is still 184.5MB. Free memory was 109.8MB in the beginning and 105.0MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 585.12ms. Allocated memory is still 184.5MB. Free memory was 104.8MB in the beginning and 79.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13144.66ms. Allocated memory was 184.5MB in the beginning and 339.7MB in the end (delta: 155.2MB). Free memory was 78.8MB in the beginning and 161.8MB in the end (delta: -83.0MB). Peak memory consumption was 73.0MB. Max. memory is 16.1GB. * Witness Printer took 4.50ms. Allocated memory is still 339.7MB. Free memory is still 161.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 115. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] signed char var_1_3 = -16; [L24] signed char var_1_4 = 50; [L25] signed char var_1_5 = 4; [L26] unsigned long int var_1_6 = 50; [L27] signed long int var_1_7 = -8; [L28] signed long int var_1_8 = -4; [L29] signed char var_1_9 = 50; [L30] unsigned char var_1_10 = 128; [L31] unsigned char var_1_11 = 5; [L32] unsigned long int var_1_12 = 10; [L33] signed char var_1_13 = 16; [L34] unsigned short int var_1_15 = 128; [L35] signed long int var_1_16 = 2; [L36] unsigned short int var_1_17 = 61498; [L37] unsigned long int var_1_18 = 1; [L38] unsigned char var_1_19 = 0; [L39] double var_1_20 = 4.9; [L40] double var_1_21 = 1.5; [L41] unsigned short int last_1_var_1_15 = 128; VAL [isInitial=0, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L119] isInitial = 1 [L120] FCALL initially() [L121] COND TRUE 1 [L122] CALL updateLastVariables() [L112] last_1_var_1_15 = var_1_15 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-16, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L122] RET updateLastVariables() [L123] CALL updateVariables() [L78] var_1_3 = __VERIFIER_nondet_char() [L79] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L79] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L80] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L80] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L81] var_1_4 = __VERIFIER_nondet_char() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L83] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L84] var_1_5 = __VERIFIER_nondet_char() [L85] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L85] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L86] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] var_1_7 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L88] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L89] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L89] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L90] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L91] var_1_8 = __VERIFIER_nondet_long() [L92] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L92] RET assume_abort_if_not(var_1_8 >= -2147483648) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L93] CALL assume_abort_if_not(var_1_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L93] RET assume_abort_if_not(var_1_8 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L94] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L95] var_1_10 = __VERIFIER_nondet_uchar() [L96] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L96] RET assume_abort_if_not(var_1_10 >= 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L97] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L98] var_1_11 = __VERIFIER_nondet_uchar() [L99] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L99] RET assume_abort_if_not(var_1_11 >= 1) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L100] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L100] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L101] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L101] RET assume_abort_if_not(var_1_11 != 127) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=2, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L102] var_1_16 = __VERIFIER_nondet_long() [L103] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L103] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L104] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L104] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=61498, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L105] var_1_17 = __VERIFIER_nondet_ushort() [L106] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L106] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L107] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L107] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_21=3/2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L108] var_1_21 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L109] RET assume_abort_if_not((var_1_21 >= -922337.2036854765600e+13F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 9223372.036854765600e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L123] RET updateVariables() [L124] CALL step() [L45] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L45] COND FALSE !(last_1_var_1_15 <= (var_1_8 & var_1_4)) [L50] var_1_9 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L52] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=128, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L52] COND TRUE ((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16)))) [L53] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L57] COND FALSE !(-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L62] var_1_18 = var_1_17 [L63] var_1_19 = 0 [L64] var_1_20 = var_1_21 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L65] COND FALSE !(\read(var_1_19)) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=10, var_1_13=16, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L68] COND TRUE var_1_3 <= var_1_1 [L69] var_1_12 = var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=16, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L73] COND TRUE (~ var_1_3) < var_1_18 [L74] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L124] RET step() [L125] CALL, EXPR property() [L115] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L115] EXPR var_1_8 & var_1_4 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L115] EXPR ((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L115] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L115] EXPR (var_1_4 + var_1_9) & var_1_7 VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L115] EXPR (((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11)))))) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L115-L116] return ((((((((var_1_19 ? (var_1_1 == ((signed char) (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))))) : 1) && ((-4 > (var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))))) ? ((var_1_4 < -16) ? (var_1_6 == ((unsigned long int) ((((32u) < 0 ) ? -(32u) : (32u))))) : 1) : 1)) && ((last_1_var_1_15 <= (var_1_8 & var_1_4)) ? ((((- 8) / (var_1_10 - var_1_11)) >= var_1_3) ? (var_1_9 == ((signed char) var_1_3)) : 1) : (var_1_9 == ((signed char) var_1_4)))) && ((var_1_3 <= var_1_1) ? (var_1_12 == ((unsigned long int) var_1_4)) : (var_1_12 == ((unsigned long int) (((((var_1_11 + var_1_4)) < (var_1_10)) ? ((var_1_11 + var_1_4)) : (var_1_10))))))) && (((~ var_1_3) < var_1_18) ? (var_1_13 == ((signed char) (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))))) : 1)) && ((((var_1_4 + var_1_9) & var_1_7) <= (var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))))) ? (var_1_15 == ((unsigned short int) (var_1_11 + 64))) : (var_1_15 == ((unsigned short int) ((((((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) > (var_1_11)) ? (((((var_1_10) > ((var_1_17 - var_1_4))) ? (var_1_10) : ((var_1_17 - var_1_4))))) : (var_1_11))))))) && (var_1_18 == ((unsigned long int) var_1_17))) && (var_1_19 == ((unsigned char) 0))) && (var_1_20 == ((double) var_1_21)) ; [L125] RET, EXPR property() [L125] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_15=128, var_1_10=128, var_1_11=2, var_1_12=0, var_1_13=-5, var_1_15=66, var_1_16=0, var_1_17=32768, var_1_18=32768, var_1_19=0, var_1_1=-10, var_1_20=2, var_1_21=2, var_1_3=-62, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 78 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.0s, OverallIterations: 10, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 503 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 503 mSDsluCounter, 2368 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1389 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 771 IncrementalHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 979 mSDtfsCounter, 771 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 467 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=8, InterpolantAutomatonStates: 40, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 233 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 8.4s InterpolantComputationTime, 1583 NumberOfCodeBlocks, 1583 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1282 ConstructedInterpolants, 0 QuantifiedInterpolants, 4486 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 8316/8316 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-20 02:21:07,534 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/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.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 925e9b76051eff442eff54c72fd139be6e9d1af6b77433b45103df887e08e16e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 02:21:09,812 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 02:21:09,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 02:21:09,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 02:21:09,897 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 02:21:09,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 02:21:09,935 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 02:21:09,936 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 02:21:09,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 02:21:09,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 02:21:09,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 02:21:09,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 02:21:09,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 02:21:09,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 02:21:09,940 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 02:21:09,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 02:21:09,941 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 02:21:09,944 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 02:21:09,944 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 02:21:09,944 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 02:21:09,947 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 02:21:09,947 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 02:21:09,948 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 02:21:09,948 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 02:21:09,948 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 02:21:09,948 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 02:21:09,948 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 02:21:09,949 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 02:21:09,949 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 02:21:09,949 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 02:21:09,949 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 02:21:09,950 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 02:21:09,950 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 02:21:09,950 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 02:21:09,950 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:21:09,951 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 02:21:09,951 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 02:21:09,953 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 02:21:09,953 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 02:21:09,954 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 02:21:09,954 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 02:21:09,954 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 02:21:09,954 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 02:21:09,954 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 02:21:09,955 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 -> 925e9b76051eff442eff54c72fd139be6e9d1af6b77433b45103df887e08e16e [2024-11-20 02:21:10,282 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 02:21:10,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 02:21:10,305 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 02:21:10,306 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 02:21:10,307 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 02:21:10,308 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i [2024-11-20 02:21:11,844 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 02:21:12,075 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 02:21:12,076 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-84.i [2024-11-20 02:21:12,089 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98d340006/dc47a5b5b7c445d98e2eb0a67e2fdd71/FLAG8f58f73ed [2024-11-20 02:21:12,107 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98d340006/dc47a5b5b7c445d98e2eb0a67e2fdd71 [2024-11-20 02:21:12,109 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 02:21:12,111 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 02:21:12,114 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 02:21:12,114 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 02:21:12,119 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 02:21:12,120 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,121 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1df6dedc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12, skipping insertion in model container [2024-11-20 02:21:12,121 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,172 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 02:21:12,356 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_codestructure_dependencies_file-84.i[919,932] [2024-11-20 02:21:12,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:21:12,449 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 02:21:12,462 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_codestructure_dependencies_file-84.i[919,932] [2024-11-20 02:21:12,502 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 02:21:12,525 INFO L204 MainTranslator]: Completed translation [2024-11-20 02:21:12,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12 WrapperNode [2024-11-20 02:21:12,526 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 02:21:12,527 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 02:21:12,527 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 02:21:12,528 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 02:21:12,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,579 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-11-20 02:21:12,580 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 02:21:12,580 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 02:21:12,580 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 02:21:12,581 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 02:21:12,593 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,593 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,597 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,615 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-20 02:21:12,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,629 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,631 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,636 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 02:21:12,637 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 02:21:12,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 02:21:12,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 02:21:12,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (1/1) ... [2024-11-20 02:21:12,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 02:21:12,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 02:21:12,688 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-20 02:21:12,694 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-20 02:21:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 02:21:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 02:21:12,753 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 02:21:12,754 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 02:21:12,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 02:21:12,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 02:21:12,825 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 02:21:12,832 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 02:21:13,331 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-20 02:21:13,331 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 02:21:13,345 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 02:21:13,345 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 02:21:13,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:21:13 BoogieIcfgContainer [2024-11-20 02:21:13,345 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 02:21:13,347 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 02:21:13,347 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 02:21:13,351 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 02:21:13,351 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:21:12" (1/3) ... [2024-11-20 02:21:13,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463c03e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:21:13, skipping insertion in model container [2024-11-20 02:21:13,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:21:12" (2/3) ... [2024-11-20 02:21:13,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@463c03e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:21:13, skipping insertion in model container [2024-11-20 02:21:13,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:21:13" (3/3) ... [2024-11-20 02:21:13,355 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-84.i [2024-11-20 02:21:13,372 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 02:21:13,373 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 02:21:13,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 02:21:13,460 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;@4111bbdb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 02:21:13,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 02:21:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand has 60 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:21:13,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 02:21:13,479 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:13,480 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:13,481 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:13,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:13,503 INFO L85 PathProgramCache]: Analyzing trace with hash 454844467, now seen corresponding path program 1 times [2024-11-20 02:21:13,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:21:13,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1212026500] [2024-11-20 02:21:13,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:13,519 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-20 02:21:13,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:21:13,523 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 02:21:13,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 02:21:13,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:13,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 02:21:13,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:21:13,840 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2024-11-20 02:21:13,841 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:21:13,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:21:13,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1212026500] [2024-11-20 02:21:13,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1212026500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:13,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:13,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 02:21:13,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432615827] [2024-11-20 02:21:13,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:13,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 02:21:13,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:21:13,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 02:21:13,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 02:21:13,877 INFO L87 Difference]: Start difference. First operand has 60 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 02:21:13,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:13,903 INFO L93 Difference]: Finished difference Result 113 states and 200 transitions. [2024-11-20 02:21:13,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 02:21:13,905 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2024-11-20 02:21:13,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:13,911 INFO L225 Difference]: With dead ends: 113 [2024-11-20 02:21:13,911 INFO L226 Difference]: Without dead ends: 56 [2024-11-20 02:21:13,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 135 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-20 02:21:13,920 INFO L432 NwaCegarLoop]: 85 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, 85 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-20 02:21:13,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 02:21:13,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-20 02:21:13,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-20 02:21:13,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:21:13,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 85 transitions. [2024-11-20 02:21:13,970 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 85 transitions. Word has length 136 [2024-11-20 02:21:13,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:13,971 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 85 transitions. [2024-11-20 02:21:13,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.5) internal successors, (33), 2 states have internal predecessors, (33), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 02:21:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 85 transitions. [2024-11-20 02:21:13,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 02:21:13,977 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:13,977 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:13,986 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 (2)] Forceful destruction successful, exit code 0 [2024-11-20 02:21:14,178 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-20 02:21:14,178 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:14,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:14,179 INFO L85 PathProgramCache]: Analyzing trace with hash 300214771, now seen corresponding path program 1 times [2024-11-20 02:21:14,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:21:14,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060839371] [2024-11-20 02:21:14,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:14,181 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-20 02:21:14,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:21:14,183 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-20 02:21:14,187 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-20 02:21:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:14,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-20 02:21:14,398 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:21:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-11-20 02:21:14,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 02:21:14,445 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:21:14,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060839371] [2024-11-20 02:21:14,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1060839371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 02:21:14,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 02:21:14,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 02:21:14,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318811632] [2024-11-20 02:21:14,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 02:21:14,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 02:21:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:21:14,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 02:21:14,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 02:21:14,450 INFO L87 Difference]: Start difference. First operand 56 states and 85 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:14,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:14,530 INFO L93 Difference]: Finished difference Result 109 states and 167 transitions. [2024-11-20 02:21:14,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 02:21:14,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 136 [2024-11-20 02:21:14,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:14,543 INFO L225 Difference]: With dead ends: 109 [2024-11-20 02:21:14,543 INFO L226 Difference]: Without dead ends: 56 [2024-11-20 02:21:14,546 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 134 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-20 02:21:14,548 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:14,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 02:21:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-20 02:21:14,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-20 02:21:14,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 32 states have (on average 1.25) internal successors, (40), 32 states have internal predecessors, (40), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:21:14,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 84 transitions. [2024-11-20 02:21:14,569 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 84 transitions. Word has length 136 [2024-11-20 02:21:14,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:14,571 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 84 transitions. [2024-11-20 02:21:14,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-11-20 02:21:14,572 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 84 transitions. [2024-11-20 02:21:14,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 02:21:14,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:14,574 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:14,583 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 (3)] Forceful destruction successful, exit code 0 [2024-11-20 02:21:14,775 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-20 02:21:14,775 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:14,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:14,776 INFO L85 PathProgramCache]: Analyzing trace with hash 2075222133, now seen corresponding path program 1 times [2024-11-20 02:21:14,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:21:14,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811343307] [2024-11-20 02:21:14,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:14,777 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-20 02:21:14,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:21:14,781 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-20 02:21:14,782 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-20 02:21:14,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:14,984 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-20 02:21:14,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:21:15,731 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 211 proven. 6 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-11-20 02:21:15,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:21:15,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 02:21:15,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811343307] [2024-11-20 02:21:15,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811343307] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:21:15,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [824986220] [2024-11-20 02:21:15,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:15,915 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 02:21:15,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 02:21:15,920 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 02:21:15,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-20 02:21:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:16,352 INFO L255 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 02:21:16,356 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 02:21:16,875 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 211 proven. 6 refuted. 0 times theorem prover too weak. 707 trivial. 0 not checked. [2024-11-20 02:21:16,876 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 02:21:16,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [824986220] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 02:21:16,979 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 02:21:16,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2024-11-20 02:21:16,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621276923] [2024-11-20 02:21:16,980 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 02:21:16,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 02:21:16,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 02:21:16,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 02:21:16,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-20 02:21:16,984 INFO L87 Difference]: Start difference. First operand 56 states and 84 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 02:21:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 02:21:19,289 INFO L93 Difference]: Finished difference Result 174 states and 255 transitions. [2024-11-20 02:21:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 02:21:19,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 136 [2024-11-20 02:21:19,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 02:21:19,293 INFO L225 Difference]: With dead ends: 174 [2024-11-20 02:21:19,293 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 02:21:19,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2024-11-20 02:21:19,297 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 137 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 02:21:19,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 297 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 02:21:19,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 02:21:19,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 61. [2024-11-20 02:21:19,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-11-20 02:21:19,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 88 transitions. [2024-11-20 02:21:19,328 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 88 transitions. Word has length 136 [2024-11-20 02:21:19,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 02:21:19,329 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 88 transitions. [2024-11-20 02:21:19,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 7 states have internal predecessors, (35), 2 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-11-20 02:21:19,330 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 88 transitions. [2024-11-20 02:21:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-20 02:21:19,331 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 02:21:19,332 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 02:21:19,341 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-20 02:21:19,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-20 02:21:19,732 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 02:21:19,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 02:21:19,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 02:21:19,734 INFO L85 PathProgramCache]: Analyzing trace with hash 2073375091, now seen corresponding path program 1 times [2024-11-20 02:21:19,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 02:21:19,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [584134580] [2024-11-20 02:21:19,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 02:21:19,735 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-20 02:21:19,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 02:21:19,738 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-20 02:21:19,739 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-20 02:21:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 02:21:19,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 02:21:19,921 INFO L278 TraceCheckSpWp]: Computing forward predicates...