./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_steplocals_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_steplocals_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 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:46:27,261 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:46:27,354 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 07:46:27,359 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:46:27,359 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:46:27,389 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:46:27,390 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:46:27,391 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:46:27,391 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:46:27,392 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:46:27,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:46:27,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:46:27,394 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:46:27,394 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:46:27,394 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:46:27,396 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:46:27,396 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:46:27,397 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:46:27,397 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 07:46:27,397 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:46:27,397 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:46:27,399 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:46:27,402 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:46:27,402 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:46:27,402 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:46:27,403 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:46:27,403 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:46:27,403 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:46:27,403 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:46:27,404 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:46:27,404 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:46:27,404 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:46:27,404 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:46:27,404 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:46:27,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:46:27,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:46:27,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 07:46:27,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 07:46:27,406 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:46:27,406 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:46:27,407 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:46:27,407 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:46:27,407 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 -> 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d [2024-10-14 07:46:27,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:46:27,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:46:27,668 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:46:27,669 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:46:27,669 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:46:27,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i [2024-10-14 07:46:29,080 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:46:29,306 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:46:29,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i [2024-10-14 07:46:29,320 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10952851/2b784b2ee8aa42f69cfa31c6862ede20/FLAG3c9c19908 [2024-10-14 07:46:29,332 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c10952851/2b784b2ee8aa42f69cfa31c6862ede20 [2024-10-14 07:46:29,334 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:46:29,335 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:46:29,337 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:46:29,337 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:46:29,342 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:46:29,342 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,343 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b56e2e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29, skipping insertion in model container [2024-10-14 07:46:29,343 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,371 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:46:29,513 WARN L248 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_steplocals_file-84.i[917,930] [2024-10-14 07:46:29,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:46:29,591 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:46:29,607 WARN L248 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_steplocals_file-84.i[917,930] [2024-10-14 07:46:29,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:46:29,708 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:46:29,709 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29 WrapperNode [2024-10-14 07:46:29,709 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:46:29,710 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:46:29,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:46:29,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:46:29,735 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,751 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,798 INFO L138 Inliner]: procedures = 26, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 194 [2024-10-14 07:46:29,799 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:46:29,799 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:46:29,799 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:46:29,800 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:46:29,814 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,838 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-10-14 07:46:29,839 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,839 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,849 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,859 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:46:29,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:46:29,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:46:29,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:46:29,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (1/1) ... [2024-10-14 07:46:29,883 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:46:29,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:46:29,909 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-10-14 07:46:29,911 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-10-14 07:46:29,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:46:29,946 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:46:29,946 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:46:29,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 07:46:29,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:46:29,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:46:30,020 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:46:30,022 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:46:30,405 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-10-14 07:46:30,406 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:46:30,443 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:46:30,443 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:46:30,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:46:30 BoogieIcfgContainer [2024-10-14 07:46:30,444 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:46:30,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:46:30,450 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:46:30,453 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:46:30,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:46:29" (1/3) ... [2024-10-14 07:46:30,454 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c2e5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:46:30, skipping insertion in model container [2024-10-14 07:46:30,454 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:46:29" (2/3) ... [2024-10-14 07:46:30,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@14c2e5f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:46:30, skipping insertion in model container [2024-10-14 07:46:30,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:46:30" (3/3) ... [2024-10-14 07:46:30,457 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-84.i [2024-10-14 07:46:30,472 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:46:30,472 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:46:30,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:46:30,538 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;@fd9b899, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:46:30,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:46:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand has 80 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:46:30,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 07:46:30,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:46:30,559 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:46:30,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:46:30,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:46:30,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1281017735, now seen corresponding path program 1 times [2024-10-14 07:46:30,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:46:30,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164430598] [2024-10-14 07:46:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:46:30,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:46:30,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:46:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:46:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:46:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:46:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:46:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:46:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:46:30,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:46:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:46:30,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:46:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:46:30,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:46:30,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:30,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:46:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:46:31,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:46:31,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:46:31,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:46:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:46:31,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:46:31,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:46:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:46:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:46:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:46:31,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:46:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:46:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:46:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:31,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:46:31,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:46:31,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164430598] [2024-10-14 07:46:31,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164430598] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:46:31,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:46:31,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:46:31,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313804671] [2024-10-14 07:46:31,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:46:31,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:46:31,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:46:31,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:46:31,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:46:31,127 INFO L87 Difference]: Start difference. First operand has 80 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 52 states have internal predecessors, (74), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:46:31,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:46:31,176 INFO L93 Difference]: Finished difference Result 157 states and 276 transitions. [2024-10-14 07:46:31,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:46:31,180 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 162 [2024-10-14 07:46:31,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:46:31,188 INFO L225 Difference]: With dead ends: 157 [2024-10-14 07:46:31,188 INFO L226 Difference]: Without dead ends: 78 [2024-10-14 07:46:31,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 80 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-10-14 07:46:31,198 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 07:46:31,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 07:46:31,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-14 07:46:31,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-14 07:46:31,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.38) internal successors, (69), 50 states have internal predecessors, (69), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:46:31,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 121 transitions. [2024-10-14 07:46:31,242 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 121 transitions. Word has length 162 [2024-10-14 07:46:31,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:46:31,242 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 121 transitions. [2024-10-14 07:46:31,242 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:46:31,243 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 121 transitions. [2024-10-14 07:46:31,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-10-14 07:46:31,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:46:31,247 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:46:31,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 07:46:31,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:46:31,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:46:31,248 INFO L85 PathProgramCache]: Analyzing trace with hash 244991861, now seen corresponding path program 1 times [2024-10-14 07:46:31,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:46:31,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005244676] [2024-10-14 07:46:31,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:46:31,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:46:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:46:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:46:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:46:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:46:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:46:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:46:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:46:37,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:46:37,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:46:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:46:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:46:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:46:37,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:46:37,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:46:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:46:37,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:46:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:46:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:38,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:46:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:46:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:38,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:46:38,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:38,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:46:38,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:38,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:46:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:38,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:46:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:38,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:46:38,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:38,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:46:38,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:38,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:46:38,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:38,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:46:38,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:46:38,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005244676] [2024-10-14 07:46:38,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005244676] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:46:38,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:46:38,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 07:46:38,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734337686] [2024-10-14 07:46:38,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:46:38,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 07:46:38,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:46:38,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 07:46:38,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:46:38,029 INFO L87 Difference]: Start difference. First operand 78 states and 121 transitions. Second operand has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:46:39,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:46:39,687 INFO L93 Difference]: Finished difference Result 245 states and 374 transitions. [2024-10-14 07:46:39,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 07:46:39,687 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 162 [2024-10-14 07:46:39,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:46:39,691 INFO L225 Difference]: With dead ends: 245 [2024-10-14 07:46:39,691 INFO L226 Difference]: Without dead ends: 168 [2024-10-14 07:46:39,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 07:46:39,693 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 154 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 07:46:39,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 410 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-14 07:46:39,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-10-14 07:46:39,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 93. [2024-10-14 07:46:39,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:46:39,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 145 transitions. [2024-10-14 07:46:39,715 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 145 transitions. Word has length 162 [2024-10-14 07:46:39,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:46:39,717 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 145 transitions. [2024-10-14 07:46:39,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.0) internal successors, (35), 7 states have internal predecessors, (35), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:46:39,717 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 145 transitions. [2024-10-14 07:46:39,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-14 07:46:39,720 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:46:39,720 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:46:39,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 07:46:39,720 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:46:39,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:46:39,721 INFO L85 PathProgramCache]: Analyzing trace with hash -864018750, now seen corresponding path program 1 times [2024-10-14 07:46:39,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:46:39,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674757010] [2024-10-14 07:46:39,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:46:39,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:46:39,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:46:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:46:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:46:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:46:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:46:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:46:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:46:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:46:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:46:42,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:46:42,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:46:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:46:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:46:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:46:42,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:46:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:46:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:46:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:46:42,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:46:42,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:46:42,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:46:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:46:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:46:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:46:42,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:46:42,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:46:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:46:42,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:46:42,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674757010] [2024-10-14 07:46:42,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674757010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:46:42,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:46:42,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:46:42,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243342131] [2024-10-14 07:46:42,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:46:42,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:46:42,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:46:42,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:46:42,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:46:42,346 INFO L87 Difference]: Start difference. First operand 93 states and 145 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:46:43,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:46:43,069 INFO L93 Difference]: Finished difference Result 217 states and 336 transitions. [2024-10-14 07:46:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:46:43,069 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2024-10-14 07:46:43,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:46:43,072 INFO L225 Difference]: With dead ends: 217 [2024-10-14 07:46:43,072 INFO L226 Difference]: Without dead ends: 125 [2024-10-14 07:46:43,073 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:46:43,074 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 144 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 07:46:43,074 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 269 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 07:46:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-14 07:46:43,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 93. [2024-10-14 07:46:43,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 65 states have (on average 1.4307692307692308) internal successors, (93), 65 states have internal predecessors, (93), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:46:43,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 145 transitions. [2024-10-14 07:46:43,085 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 145 transitions. Word has length 163 [2024-10-14 07:46:43,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:46:43,086 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 145 transitions. [2024-10-14 07:46:43,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:46:43,086 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 145 transitions. [2024-10-14 07:46:43,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-10-14 07:46:43,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:46:43,092 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:46:43,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 07:46:43,093 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:46:43,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:46:43,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1885087104, now seen corresponding path program 1 times [2024-10-14 07:46:43,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:46:43,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647297243] [2024-10-14 07:46:43,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:46:43,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:46:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:46:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:46:45,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:46:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:46:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:46:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:46:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:46:45,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:46:45,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:46:45,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:46:45,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:46:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:46:45,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:46:45,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:46:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:46:45,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:46:45,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:46:45,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:46:45,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:46:45,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:46:45,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:46:45,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:46:45,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:46:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:46:45,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:46:45,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:46:45,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:46:45,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:46:45,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647297243] [2024-10-14 07:46:45,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647297243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:46:45,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:46:45,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 07:46:45,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506820487] [2024-10-14 07:46:45,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:46:45,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 07:46:45,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:46:45,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 07:46:45,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-14 07:46:45,197 INFO L87 Difference]: Start difference. First operand 93 states and 145 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:46:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:46:46,178 INFO L93 Difference]: Finished difference Result 232 states and 355 transitions. [2024-10-14 07:46:46,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 07:46:46,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 163 [2024-10-14 07:46:46,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:46:46,181 INFO L225 Difference]: With dead ends: 232 [2024-10-14 07:46:46,181 INFO L226 Difference]: Without dead ends: 140 [2024-10-14 07:46:46,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-14 07:46:46,183 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 119 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 07:46:46,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 268 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 07:46:46,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-14 07:46:46,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 78. [2024-10-14 07:46:46,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:46:46,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 120 transitions. [2024-10-14 07:46:46,193 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 120 transitions. Word has length 163 [2024-10-14 07:46:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:46:46,194 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 120 transitions. [2024-10-14 07:46:46,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:46:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 120 transitions. [2024-10-14 07:46:46,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 07:46:46,197 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:46:46,197 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:46:46,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 07:46:46,197 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:46:46,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:46:46,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1426385254, now seen corresponding path program 1 times [2024-10-14 07:46:46,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:46:46,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339191935] [2024-10-14 07:46:46,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:46:46,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:46:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:46:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:46:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:46:49,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:46:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:46:49,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:46:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:46:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:46:49,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:46:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:46:49,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:46:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:46:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:46:49,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:46:49,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:46:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:46:49,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:46:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:46:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:46:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:46:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:46:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:46:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:46:49,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:46:49,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:46:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:46:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:49,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:46:49,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:46:49,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339191935] [2024-10-14 07:46:49,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339191935] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:46:49,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:46:49,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 07:46:49,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111840653] [2024-10-14 07:46:49,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:46:49,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 07:46:49,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:46:49,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 07:46:49,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-14 07:46:49,910 INFO L87 Difference]: Start difference. First operand 78 states and 120 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:46:51,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:46:51,232 INFO L93 Difference]: Finished difference Result 309 states and 459 transitions. [2024-10-14 07:46:51,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 07:46:51,233 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 164 [2024-10-14 07:46:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:46:51,235 INFO L225 Difference]: With dead ends: 309 [2024-10-14 07:46:51,235 INFO L226 Difference]: Without dead ends: 232 [2024-10-14 07:46:51,238 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2024-10-14 07:46:51,240 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 228 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-14 07:46:51,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 546 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-14 07:46:51,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-10-14 07:46:51,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 204. [2024-10-14 07:46:51,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 141 states have (on average 1.3617021276595744) internal successors, (192), 143 states have internal predecessors, (192), 58 states have call successors, (58), 4 states have call predecessors, (58), 4 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2024-10-14 07:46:51,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 308 transitions. [2024-10-14 07:46:51,292 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 308 transitions. Word has length 164 [2024-10-14 07:46:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:46:51,293 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 308 transitions. [2024-10-14 07:46:51,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 10 states have internal predecessors, (37), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:46:51,294 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 308 transitions. [2024-10-14 07:46:51,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-10-14 07:46:51,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:46:51,298 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:46:51,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 07:46:51,298 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:46:51,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:46:51,299 INFO L85 PathProgramCache]: Analyzing trace with hash -2013191268, now seen corresponding path program 1 times [2024-10-14 07:46:51,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:46:51,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767552508] [2024-10-14 07:46:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:46:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:46:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:46:54,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:46:54,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:46:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:46:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:46:54,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:46:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:46:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:46:54,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:46:54,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:46:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:46:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:46:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:46:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:46:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:46:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:46:54,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:46:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:46:54,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:46:54,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:46:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:46:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:46:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:46:54,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:46:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:46:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:46:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:46:54,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:46:54,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:46:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767552508] [2024-10-14 07:46:54,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767552508] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:46:54,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:46:54,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 07:46:54,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597256616] [2024-10-14 07:46:54,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:46:54,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 07:46:54,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:46:54,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 07:46:54,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-14 07:46:54,619 INFO L87 Difference]: Start difference. First operand 204 states and 308 transitions. Second operand has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:46:55,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:46:55,761 INFO L93 Difference]: Finished difference Result 439 states and 651 transitions. [2024-10-14 07:46:55,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 07:46:55,761 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 164 [2024-10-14 07:46:55,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:46:55,767 INFO L225 Difference]: With dead ends: 439 [2024-10-14 07:46:55,767 INFO L226 Difference]: Without dead ends: 239 [2024-10-14 07:46:55,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2024-10-14 07:46:55,769 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 220 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 07:46:55,769 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 481 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 07:46:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2024-10-14 07:46:55,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 233. [2024-10-14 07:46:55,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 164 states have (on average 1.3414634146341464) internal successors, (220), 167 states have internal predecessors, (220), 62 states have call successors, (62), 6 states have call predecessors, (62), 6 states have return successors, (62), 59 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-14 07:46:55,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 344 transitions. [2024-10-14 07:46:55,819 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 344 transitions. Word has length 164 [2024-10-14 07:46:55,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:46:55,820 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 344 transitions. [2024-10-14 07:46:55,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 11 states have internal predecessors, (37), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:46:55,820 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 344 transitions. [2024-10-14 07:46:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 07:46:55,823 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:46:55,823 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:46:55,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 07:46:55,824 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:46:55,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:46:55,824 INFO L85 PathProgramCache]: Analyzing trace with hash -2033693017, now seen corresponding path program 1 times [2024-10-14 07:46:55,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:46:55,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662628226] [2024-10-14 07:46:55,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:46:55,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:46:55,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:47:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:47:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:47:02,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:47:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:47:02,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:47:02,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:47:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:47:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:47:02,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:47:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:47:02,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:47:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:47:02,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:47:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:47:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:47:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:47:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:47:02,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:47:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:47:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:47:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:47:02,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:47:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:47:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:47:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:47:02,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:47:02,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:47:02,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662628226] [2024-10-14 07:47:02,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662628226] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:47:02,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:47:02,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 07:47:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037685531] [2024-10-14 07:47:02,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:47:02,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 07:47:02,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:47:02,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 07:47:02,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:47:02,160 INFO L87 Difference]: Start difference. First operand 233 states and 344 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:47:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:47:06,291 INFO L93 Difference]: Finished difference Result 424 states and 616 transitions. [2024-10-14 07:47:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 07:47:06,292 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-10-14 07:47:06,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:47:06,295 INFO L225 Difference]: With dead ends: 424 [2024-10-14 07:47:06,295 INFO L226 Difference]: Without dead ends: 347 [2024-10-14 07:47:06,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2024-10-14 07:47:06,297 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 362 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 507 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-14 07:47:06,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 507 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-14 07:47:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-10-14 07:47:06,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 319. [2024-10-14 07:47:06,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 239 states have (on average 1.3598326359832635) internal successors, (325), 244 states have internal predecessors, (325), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 07:47:06,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 465 transitions. [2024-10-14 07:47:06,357 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 465 transitions. Word has length 165 [2024-10-14 07:47:06,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:47:06,357 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 465 transitions. [2024-10-14 07:47:06,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:47:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 465 transitions. [2024-10-14 07:47:06,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 07:47:06,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:47:06,361 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:47:06,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 07:47:06,361 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:47:06,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:47:06,362 INFO L85 PathProgramCache]: Analyzing trace with hash 1674468265, now seen corresponding path program 1 times [2024-10-14 07:47:06,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:47:06,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509661502] [2024-10-14 07:47:06,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:47:06,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:47:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:47:12,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:47:12,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:47:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:47:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:47:12,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:47:12,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:47:12,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:47:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:47:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:47:12,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:47:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:47:12,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:47:12,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:47:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:47:12,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:47:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:47:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:47:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:47:12,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:47:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:47:12,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:47:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:47:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:47:12,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:47:12,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:47:12,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:12,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:47:12,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:47:12,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509661502] [2024-10-14 07:47:12,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509661502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:47:12,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:47:12,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-14 07:47:12,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800988846] [2024-10-14 07:47:12,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:47:12,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 07:47:12,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:47:12,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 07:47:12,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2024-10-14 07:47:12,821 INFO L87 Difference]: Start difference. First operand 319 states and 465 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:47:18,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:47:18,866 INFO L93 Difference]: Finished difference Result 644 states and 918 transitions. [2024-10-14 07:47:18,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 07:47:18,867 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2024-10-14 07:47:18,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:47:18,870 INFO L225 Difference]: With dead ends: 644 [2024-10-14 07:47:18,870 INFO L226 Difference]: Without dead ends: 481 [2024-10-14 07:47:18,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2024-10-14 07:47:18,872 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 541 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 541 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 1264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:47:18,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [541 Valid, 491 Invalid, 1264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1212 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-10-14 07:47:18,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2024-10-14 07:47:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 323. [2024-10-14 07:47:18,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 243 states have (on average 1.3662551440329218) internal successors, (332), 248 states have internal predecessors, (332), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 07:47:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 472 transitions. [2024-10-14 07:47:18,926 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 472 transitions. Word has length 165 [2024-10-14 07:47:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:47:18,927 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 472 transitions. [2024-10-14 07:47:18,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 16 states have internal predecessors, (38), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:47:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 472 transitions. [2024-10-14 07:47:18,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 07:47:18,930 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:47:18,930 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:47:18,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 07:47:18,930 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:47:18,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:47:18,931 INFO L85 PathProgramCache]: Analyzing trace with hash 394604587, now seen corresponding path program 1 times [2024-10-14 07:47:18,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:47:18,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140339313] [2024-10-14 07:47:18,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:47:18,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:47:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:47:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:47:22,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:47:22,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:47:22,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:47:22,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:47:22,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:47:22,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:47:22,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:47:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:47:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:47:22,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:47:22,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:47:22,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:47:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:47:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:47:22,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:47:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:47:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:47:22,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:47:22,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:47:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:47:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:47:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:47:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:47:22,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:47:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:47:22,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:47:22,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140339313] [2024-10-14 07:47:22,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140339313] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:47:22,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:47:22,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-14 07:47:22,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676726113] [2024-10-14 07:47:22,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:47:22,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 07:47:22,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:47:22,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 07:47:22,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2024-10-14 07:47:22,627 INFO L87 Difference]: Start difference. First operand 323 states and 472 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:47:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:47:25,517 INFO L93 Difference]: Finished difference Result 640 states and 913 transitions. [2024-10-14 07:47:25,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 07:47:25,517 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-14 07:47:25,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:47:25,521 INFO L225 Difference]: With dead ends: 640 [2024-10-14 07:47:25,521 INFO L226 Difference]: Without dead ends: 473 [2024-10-14 07:47:25,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2024-10-14 07:47:25,524 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 191 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1004 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 07:47:25,525 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 1004 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 07:47:25,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-14 07:47:25,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 323. [2024-10-14 07:47:25,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 243 states have (on average 1.3662551440329218) internal successors, (332), 248 states have internal predecessors, (332), 70 states have call successors, (70), 9 states have call predecessors, (70), 9 states have return successors, (70), 65 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 07:47:25,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 472 transitions. [2024-10-14 07:47:25,575 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 472 transitions. Word has length 165 [2024-10-14 07:47:25,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:47:25,576 INFO L471 AbstractCegarLoop]: Abstraction has 323 states and 472 transitions. [2024-10-14 07:47:25,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:47:25,576 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 472 transitions. [2024-10-14 07:47:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 07:47:25,577 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:47:25,577 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:47:25,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 07:47:25,577 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:47:25,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:47:25,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1941116015, now seen corresponding path program 1 times [2024-10-14 07:47:25,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:47:25,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412574477] [2024-10-14 07:47:25,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:47:25,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:47:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:47:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:47:25,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:47:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:47:25,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:47:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:47:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:47:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:47:25,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:47:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:47:25,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:47:25,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:47:25,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:47:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:47:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:47:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:47:25,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:47:25,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:47:25,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:47:25,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:47:25,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:47:25,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:47:25,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:47:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:47:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:47:25,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:47:25,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:25,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:47:25,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:47:25,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412574477] [2024-10-14 07:47:25,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412574477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:47:25,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:47:25,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:47:25,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184578949] [2024-10-14 07:47:25,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:47:25,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:47:25,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:47:25,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:47:25,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:47:25,672 INFO L87 Difference]: Start difference. First operand 323 states and 472 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:47:25,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:47:25,817 INFO L93 Difference]: Finished difference Result 837 states and 1206 transitions. [2024-10-14 07:47:25,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:47:25,818 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-14 07:47:25,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:47:25,824 INFO L225 Difference]: With dead ends: 837 [2024-10-14 07:47:25,824 INFO L226 Difference]: Without dead ends: 518 [2024-10-14 07:47:25,826 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-10-14 07:47:25,826 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 39 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:47:25,826 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 187 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:47:25,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2024-10-14 07:47:25,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 385. [2024-10-14 07:47:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 300 states have (on average 1.3833333333333333) internal successors, (415), 306 states have internal predecessors, (415), 74 states have call successors, (74), 10 states have call predecessors, (74), 10 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-14 07:47:25,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 563 transitions. [2024-10-14 07:47:25,877 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 563 transitions. Word has length 165 [2024-10-14 07:47:25,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:47:25,878 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 563 transitions. [2024-10-14 07:47:25,878 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, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:47:25,878 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 563 transitions. [2024-10-14 07:47:25,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-10-14 07:47:25,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:47:25,880 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:47:25,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 07:47:25,880 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:47:25,881 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:47:25,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1029268087, now seen corresponding path program 1 times [2024-10-14 07:47:25,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:47:25,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985316213] [2024-10-14 07:47:25,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:47:25,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:47:25,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:47:26,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:47:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:47:26,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:47:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:47:26,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:47:26,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:47:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:47:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:47:26,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:47:26,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:47:26,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:47:26,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:47:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:47:26,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:47:26,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:47:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:47:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:47:26,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:47:26,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:47:26,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:47:26,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:47:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:47:26,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:47:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:47:26,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:47:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,117 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:47:26,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:47:26,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985316213] [2024-10-14 07:47:26,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985316213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:47:26,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:47:26,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:47:26,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870654616] [2024-10-14 07:47:26,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:47:26,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:47:26,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:47:26,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:47:26,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:47:26,119 INFO L87 Difference]: Start difference. First operand 385 states and 563 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:47:26,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:47:26,274 INFO L93 Difference]: Finished difference Result 756 states and 1103 transitions. [2024-10-14 07:47:26,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:47:26,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 165 [2024-10-14 07:47:26,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:47:26,278 INFO L225 Difference]: With dead ends: 756 [2024-10-14 07:47:26,278 INFO L226 Difference]: Without dead ends: 375 [2024-10-14 07:47:26,279 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:47:26,280 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 76 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:47:26,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 296 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:47:26,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-14 07:47:26,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 373. [2024-10-14 07:47:26,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 373 states, 288 states have (on average 1.375) internal successors, (396), 294 states have internal predecessors, (396), 74 states have call successors, (74), 10 states have call predecessors, (74), 10 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-14 07:47:26,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 544 transitions. [2024-10-14 07:47:26,331 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 544 transitions. Word has length 165 [2024-10-14 07:47:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:47:26,332 INFO L471 AbstractCegarLoop]: Abstraction has 373 states and 544 transitions. [2024-10-14 07:47:26,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:47:26,333 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 544 transitions. [2024-10-14 07:47:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 07:47:26,335 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:47:26,335 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:47:26,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 07:47:26,335 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:47:26,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:47:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash -617403382, now seen corresponding path program 1 times [2024-10-14 07:47:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:47:26,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129243072] [2024-10-14 07:47:26,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:47:26,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:47:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:47:26,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:47:26,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:47:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:47:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:47:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:47:26,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:47:26,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:47:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:47:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:47:26,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:47:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:47:26,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:47:26,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:47:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:47:26,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:47:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:47:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:47:26,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:47:26,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:47:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:47:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:47:26,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:47:26,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:47:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:47:26,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:47:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:47:26,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:47:26,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129243072] [2024-10-14 07:47:26,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129243072] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:47:26,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:47:26,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 07:47:26,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132653207] [2024-10-14 07:47:26,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:47:26,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 07:47:26,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:47:26,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 07:47:26,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 07:47:26,510 INFO L87 Difference]: Start difference. First operand 373 states and 544 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:47:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:47:26,668 INFO L93 Difference]: Finished difference Result 562 states and 821 transitions. [2024-10-14 07:47:26,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 07:47:26,669 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-14 07:47:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:47:26,672 INFO L225 Difference]: With dead ends: 562 [2024-10-14 07:47:26,672 INFO L226 Difference]: Without dead ends: 374 [2024-10-14 07:47:26,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 07:47:26,673 INFO L432 NwaCegarLoop]: 224 mSDtfsCounter, 119 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:47:26,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 495 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:47:26,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-14 07:47:26,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 372. [2024-10-14 07:47:26,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 287 states have (on average 1.3658536585365855) internal successors, (392), 293 states have internal predecessors, (392), 74 states have call successors, (74), 10 states have call predecessors, (74), 10 states have return successors, (74), 68 states have call predecessors, (74), 74 states have call successors, (74) [2024-10-14 07:47:26,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 540 transitions. [2024-10-14 07:47:26,726 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 540 transitions. Word has length 166 [2024-10-14 07:47:26,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:47:26,727 INFO L471 AbstractCegarLoop]: Abstraction has 372 states and 540 transitions. [2024-10-14 07:47:26,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:47:26,727 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 540 transitions. [2024-10-14 07:47:26,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 07:47:26,729 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:47:26,729 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:47:26,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 07:47:26,729 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:47:26,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:47:26,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1955676318, now seen corresponding path program 1 times [2024-10-14 07:47:26,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:47:26,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752284024] [2024-10-14 07:47:26,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:47:26,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:47:26,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:47:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:47:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:47:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:47:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:47:26,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:47:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:47:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:47:26,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:47:26,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:47:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:47:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:47:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:47:26,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:47:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:47:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:47:26,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:47:26,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:47:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:47:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:47:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:47:26,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:47:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:47:26,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:47:26,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:47:26,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:47:26,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-10-14 07:47:26,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:47:26,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752284024] [2024-10-14 07:47:26,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752284024] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:47:26,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:47:26,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 07:47:26,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371432697] [2024-10-14 07:47:26,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:47:26,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 07:47:26,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:47:26,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 07:47:26,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 07:47:26,821 INFO L87 Difference]: Start difference. First operand 372 states and 540 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:47:26,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:47:26,975 INFO L93 Difference]: Finished difference Result 794 states and 1135 transitions. [2024-10-14 07:47:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 07:47:26,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 166 [2024-10-14 07:47:26,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:47:26,978 INFO L225 Difference]: With dead ends: 794 [2024-10-14 07:47:26,979 INFO L226 Difference]: Without dead ends: 426 [2024-10-14 07:47:26,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 54 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-10-14 07:47:26,980 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 44 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:47:26,981 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 193 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:47:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2024-10-14 07:47:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 318. [2024-10-14 07:47:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 241 states have (on average 1.3319502074688796) internal successors, (321), 245 states have internal predecessors, (321), 66 states have call successors, (66), 10 states have call predecessors, (66), 10 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 07:47:27,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 453 transitions. [2024-10-14 07:47:27,030 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 453 transitions. Word has length 166 [2024-10-14 07:47:27,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:47:27,031 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 453 transitions. [2024-10-14 07:47:27,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-10-14 07:47:27,031 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 453 transitions. [2024-10-14 07:47:27,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 07:47:27,032 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:47:27,033 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:47:27,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 07:47:27,033 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:47:27,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:47:27,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1183637569, now seen corresponding path program 1 times [2024-10-14 07:47:27,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:47:27,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247631129] [2024-10-14 07:47:27,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:47:27,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:47:27,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 07:47:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 07:47:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 07:47:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 07:47:27,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 07:47:27,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 07:47:27,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 07:47:27,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 07:47:27,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 07:47:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 07:47:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-14 07:47:27,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 07:47:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-14 07:47:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-14 07:47:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-14 07:47:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-14 07:47:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-14 07:47:27,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-14 07:47:27,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-14 07:47:27,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-14 07:47:27,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-14 07:47:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-14 07:47:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-14 07:47:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-10-14 07:47:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-10-14 07:47:27,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-10-14 07:47:27,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 90 proven. 54 refuted. 0 times theorem prover too weak. 1156 trivial. 0 not checked. [2024-10-14 07:47:27,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 07:47:27,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247631129] [2024-10-14 07:47:27,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247631129] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 07:47:27,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1241217880] [2024-10-14 07:47:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:47:27,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:47:27,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:47:27,432 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-10-14 07:47:27,433 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-10-14 07:47:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:27,568 INFO L255 TraceCheckSpWp]: Trace formula consists of 374 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-14 07:47:27,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:47:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 750 proven. 54 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2024-10-14 07:47:28,023 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 07:47:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 90 proven. 57 refuted. 0 times theorem prover too weak. 1153 trivial. 0 not checked. [2024-10-14 07:47:28,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1241217880] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 07:47:28,477 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 07:47:28,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 21 [2024-10-14 07:47:28,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835972914] [2024-10-14 07:47:28,477 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 07:47:28,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-14 07:47:28,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 07:47:28,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-14 07:47:28,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=325, Unknown=0, NotChecked=0, Total=420 [2024-10-14 07:47:28,479 INFO L87 Difference]: Start difference. First operand 318 states and 453 transitions. Second operand has 21 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 6 states have call successors, (40), 3 states have call predecessors, (40), 7 states have return successors, (41), 6 states have call predecessors, (41), 6 states have call successors, (41) [2024-10-14 07:47:29,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:47:29,082 INFO L93 Difference]: Finished difference Result 680 states and 952 transitions. [2024-10-14 07:47:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 07:47:29,083 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 6 states have call successors, (40), 3 states have call predecessors, (40), 7 states have return successors, (41), 6 states have call predecessors, (41), 6 states have call successors, (41) Word has length 166 [2024-10-14 07:47:29,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:47:29,086 INFO L225 Difference]: With dead ends: 680 [2024-10-14 07:47:29,086 INFO L226 Difference]: Without dead ends: 366 [2024-10-14 07:47:29,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 401 GetRequests, 372 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 192 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=216, Invalid=596, Unknown=0, NotChecked=0, Total=812 [2024-10-14 07:47:29,088 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 127 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 518 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 07:47:29,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 518 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 07:47:29,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-10-14 07:47:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 342. [2024-10-14 07:47:29,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 261 states have (on average 1.3065134099616857) internal successors, (341), 265 states have internal predecessors, (341), 66 states have call successors, (66), 14 states have call predecessors, (66), 14 states have return successors, (66), 62 states have call predecessors, (66), 66 states have call successors, (66) [2024-10-14 07:47:29,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 473 transitions. [2024-10-14 07:47:29,156 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 473 transitions. Word has length 166 [2024-10-14 07:47:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:47:29,156 INFO L471 AbstractCegarLoop]: Abstraction has 342 states and 473 transitions. [2024-10-14 07:47:29,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.85) internal successors, (77), 20 states have internal predecessors, (77), 6 states have call successors, (40), 3 states have call predecessors, (40), 7 states have return successors, (41), 6 states have call predecessors, (41), 6 states have call successors, (41) [2024-10-14 07:47:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 473 transitions. [2024-10-14 07:47:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-10-14 07:47:29,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:47:29,158 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:47:29,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 07:47:29,362 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,SelfDestructingSolverStorable13 [2024-10-14 07:47:29,363 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:47:29,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:47:29,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1441803007, now seen corresponding path program 1 times [2024-10-14 07:47:29,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 07:47:29,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313004030] [2024-10-14 07:47:29,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:47:29,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 07:47:29,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 07:47:29,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2142048565] [2024-10-14 07:47:29,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:47:29,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 07:47:29,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:47:29,438 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 07:47:29,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 07:47:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:47:29,584 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 07:47:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 07:47:29,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 07:47:29,762 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 07:47:29,763 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 07:47:29,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 07:47:29,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-14 07:47:29,969 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 07:47:30,075 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 07:47:30,081 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 07:47:30 BoogieIcfgContainer [2024-10-14 07:47:30,081 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 07:47:30,082 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 07:47:30,082 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 07:47:30,082 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 07:47:30,083 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:46:30" (3/4) ... [2024-10-14 07:47:30,085 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 07:47:30,086 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 07:47:30,086 INFO L158 Benchmark]: Toolchain (without parser) took 60750.71ms. Allocated memory was 159.4MB in the beginning and 589.3MB in the end (delta: 429.9MB). Free memory was 91.2MB in the beginning and 319.1MB in the end (delta: -228.0MB). Peak memory consumption was 202.2MB. Max. memory is 16.1GB. [2024-10-14 07:47:30,086 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 115.3MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:47:30,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.24ms. Allocated memory is still 159.4MB. Free memory was 90.9MB in the beginning and 128.9MB in the end (delta: -37.9MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. [2024-10-14 07:47:30,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.65ms. Allocated memory is still 159.4MB. Free memory was 128.9MB in the beginning and 125.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 07:47:30,088 INFO L158 Benchmark]: Boogie Preprocessor took 72.71ms. Allocated memory is still 159.4MB. Free memory was 125.3MB in the beginning and 119.9MB in the end (delta: 5.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 07:47:30,088 INFO L158 Benchmark]: RCFGBuilder took 571.14ms. Allocated memory is still 159.4MB. Free memory was 119.9MB in the beginning and 90.5MB in the end (delta: 29.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-10-14 07:47:30,089 INFO L158 Benchmark]: TraceAbstraction took 59633.16ms. Allocated memory was 159.4MB in the beginning and 589.3MB in the end (delta: 429.9MB). Free memory was 90.2MB in the beginning and 319.1MB in the end (delta: -228.9MB). Peak memory consumption was 203.1MB. Max. memory is 16.1GB. [2024-10-14 07:47:30,089 INFO L158 Benchmark]: Witness Printer took 3.91ms. Allocated memory is still 589.3MB. Free memory is still 319.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 07:47:30,090 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 115.3MB. Free memory is still 79.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 372.24ms. Allocated memory is still 159.4MB. Free memory was 90.9MB in the beginning and 128.9MB in the end (delta: -37.9MB). Peak memory consumption was 17.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.65ms. Allocated memory is still 159.4MB. Free memory was 128.9MB in the beginning and 125.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.71ms. Allocated memory is still 159.4MB. Free memory was 125.3MB in the beginning and 119.9MB in the end (delta: 5.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 571.14ms. Allocated memory is still 159.4MB. Free memory was 119.9MB in the beginning and 90.5MB in the end (delta: 29.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 59633.16ms. Allocated memory was 159.4MB in the beginning and 589.3MB in the end (delta: 429.9MB). Free memory was 90.2MB in the beginning and 319.1MB in the end (delta: -228.9MB). Peak memory consumption was 203.1MB. Max. memory is 16.1GB. * Witness Printer took 3.91ms. Allocated memory is still 589.3MB. Free memory is still 319.1MB. 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 125. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = -10; [L23] unsigned char var_1_2 = 1; [L24] signed char var_1_3 = -16; [L25] signed char var_1_4 = 50; [L26] signed char var_1_5 = 4; [L27] unsigned long int var_1_6 = 50; [L28] signed long int var_1_7 = -8; [L29] signed long int var_1_8 = -4; [L30] signed char var_1_9 = 50; [L31] unsigned char var_1_10 = 128; [L32] unsigned char var_1_11 = 5; [L33] unsigned long int var_1_12 = 10; [L34] signed char var_1_13 = 16; [L35] signed long int var_1_14 = 1; [L36] unsigned short int var_1_15 = 128; [L37] signed long int var_1_16 = 2; [L38] unsigned short int var_1_17 = 61498; [L39] unsigned long int var_1_18 = 1; [L40] unsigned char var_1_19 = 0; [L41] double var_1_20 = 4.9; [L42] double var_1_21 = 1.5; [L129] isInitial = 1 [L130] FCALL initially() [L131] COND TRUE 1 [L132] FCALL updateLastVariables() [L133] CALL updateVariables() [L83] var_1_2 = __VERIFIER_nondet_uchar() [L84] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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] [L84] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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] [L85] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, 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] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, 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] [L85] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, 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] [L86] var_1_3 = __VERIFIER_nondet_char() [L87] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L87] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L88] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=50, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L89] var_1_4 = __VERIFIER_nondet_char() [L90] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L90] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L91] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=4, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L92] var_1_5 = __VERIFIER_nondet_char() [L93] CALL assume_abort_if_not(var_1_5 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L93] RET assume_abort_if_not(var_1_5 >= -127) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L94] CALL assume_abort_if_not(var_1_5 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L94] RET assume_abort_if_not(var_1_5 <= 126) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=-8, var_1_8=-4, var_1_9=50] [L95] var_1_7 = __VERIFIER_nondet_long() [L96] CALL assume_abort_if_not(var_1_7 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L96] RET assume_abort_if_not(var_1_7 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L97] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L97] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L98] CALL assume_abort_if_not(var_1_7 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L98] RET assume_abort_if_not(var_1_7 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-4, var_1_9=50] [L99] var_1_8 = __VERIFIER_nondet_long() [L100] CALL assume_abort_if_not(var_1_8 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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_8 >= -2147483648) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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_8 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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_8 <= 2147483647) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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] CALL assume_abort_if_not(var_1_8 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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] RET assume_abort_if_not(var_1_8 != 0) VAL [isInitial=1, var_1_10=128, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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] var_1_10 = __VERIFIER_nondet_uchar() [L104] CALL assume_abort_if_not(var_1_10 >= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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_10 >= 127) VAL [isInitial=1, var_1_10=-129, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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] CALL assume_abort_if_not(var_1_10 <= 255) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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] RET assume_abort_if_not(var_1_10 <= 255) VAL [isInitial=1, var_1_10=-129, var_1_11=5, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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] var_1_11 = __VERIFIER_nondet_uchar() [L107] CALL assume_abort_if_not(var_1_11 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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_11 >= 1) VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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] CALL assume_abort_if_not(var_1_11 != 127) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, 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_11 != 127) VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L110] var_1_14 = __VERIFIER_nondet_long() [L111] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, 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_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L111] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L112] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, 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_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L112] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L113] var_1_16 = __VERIFIER_nondet_long() [L114] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, 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_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L114] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L115] CALL assume_abort_if_not(var_1_16 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, 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_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L115] RET assume_abort_if_not(var_1_16 <= 2147483647) VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L116] var_1_17 = __VERIFIER_nondet_ushort() [L117] CALL assume_abort_if_not(var_1_17 >= 32767) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, 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_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L117] RET assume_abort_if_not(var_1_17 >= 32767) VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L118] CALL assume_abort_if_not(var_1_17 <= 65534) VAL [\old(cond)=1, isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, 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_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L118] RET assume_abort_if_not(var_1_17 <= 65534) VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, 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_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L119] var_1_21 = __VERIFIER_nondet_double() [L120] 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, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L120] 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, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=-10, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L133] RET updateVariables() [L134] CALL step() [L46] COND TRUE \read(var_1_2) [L47] var_1_1 = (((((var_1_3 + (1 - var_1_4))) < (var_1_5)) ? ((var_1_3 + (1 - var_1_4))) : (var_1_5))) VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L49] signed long int stepLocal_1 = -16; [L50] signed long int stepLocal_0 = var_1_5 / ((((var_1_7) > (var_1_8)) ? (var_1_7) : (var_1_8))); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=-16, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L51] COND FALSE !(-4 > stepLocal_0) VAL [isInitial=1, stepLocal_1=-16, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L56] EXPR var_1_8 & var_1_4 VAL [isInitial=1, stepLocal_1=-16, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=50] [L56] COND FALSE !(var_1_6 <= (var_1_8 & var_1_4)) [L61] var_1_9 = var_1_4 VAL [isInitial=1, stepLocal_1=-16, var_1_10=-129, var_1_11=377, var_1_12=10, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L63] COND TRUE var_1_3 <= var_1_1 [L64] var_1_12 = var_1_4 VAL [isInitial=1, stepLocal_1=-16, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, 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] signed long int stepLocal_2 = var_1_14; VAL [isInitial=1, stepLocal_1=-16, stepLocal_2=0, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=16, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L69] COND TRUE (~ var_1_3) < stepLocal_2 [L70] var_1_13 = (((((var_1_4 + var_1_3)) > (-5)) ? ((var_1_4 + var_1_3)) : (-5))) VAL [isInitial=1, stepLocal_1=-16, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L72] signed long int stepLocal_3 = var_1_10 - ((((var_1_11) < (var_1_16)) ? (var_1_11) : (var_1_16))); VAL [isInitial=1, stepLocal_1=-16, stepLocal_3=126, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, 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] EXPR (var_1_4 + var_1_14) & var_1_7 VAL [isInitial=1, stepLocal_1=-16, stepLocal_3=126, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=128, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, 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_4 + var_1_14) & var_1_7) <= stepLocal_3 [L74] var_1_15 = (var_1_11 + 64) VAL [isInitial=1, stepLocal_1=-16, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=185, var_1_16=1, var_1_17=-32768, var_1_18=1, var_1_19=0, var_1_1=2, var_1_20=49/10, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L78] var_1_18 = var_1_17 [L79] var_1_19 = 0 [L80] var_1_20 = var_1_21 [L134] RET step() [L135] CALL, EXPR property() [L125] EXPR ((var_1_2 ? (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)) && ((var_1_6 <= (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, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=185, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L125] EXPR var_1_8 & var_1_4 VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=185, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L125] EXPR ((var_1_2 ? (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)) && ((var_1_6 <= (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, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=185, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L125] EXPR (((((var_1_2 ? (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)) && ((var_1_6 <= (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_14) ? (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_14) & 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, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=185, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L125] EXPR (var_1_4 + var_1_14) & var_1_7 VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=185, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L125] EXPR (((((var_1_2 ? (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)) && ((var_1_6 <= (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_14) ? (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_14) & 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, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=185, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, var_1_4=0, var_1_5=2, var_1_6=50, var_1_7=4, var_1_8=-2147483647, var_1_9=0] [L125-L126] return ((((((((var_1_2 ? (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)) && ((var_1_6 <= (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_14) ? (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_14) & 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)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=185, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, 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, var_1_10=-129, var_1_11=377, var_1_12=0, var_1_13=2, var_1_14=0, var_1_15=185, var_1_16=1, var_1_17=-32768, var_1_18=32768, var_1_19=0, var_1_1=2, var_1_20=2, var_1_21=2, var_1_2=1, var_1_3=2, 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, 80 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 59.5s, OverallIterations: 15, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2379 SdHoareTripleChecker+Valid, 14.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2364 mSDsluCounter, 5782 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4113 mSDsCounter, 194 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6629 IncrementalHoareTripleChecker+Invalid, 6823 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 194 mSolverCounterUnsat, 1669 mSDtfsCounter, 6629 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1250 GetRequests, 1108 SyntacticMatches, 2 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 12.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385occurred in iteration=10, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 14 MinimizatonAttempts, 808 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 36.6s InterpolantComputationTime, 2799 NumberOfCodeBlocks, 2799 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 2617 ConstructedInterpolants, 0 QuantifiedInterpolants, 26201 SizeOfPredicates, 6 NumberOfNonLiveVariables, 374 ConjunctsInSsa, 13 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 20635/20800 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-10-14 07:47:30,307 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-10-14 07:47:30,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_steplocals_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 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 07:47:32,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 07:47:32,493 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 07:47:32,499 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 07:47:32,500 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 07:47:32,536 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 07:47:32,537 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 07:47:32,537 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 07:47:32,537 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 07:47:32,538 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 07:47:32,539 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 07:47:32,540 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 07:47:32,540 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 07:47:32,543 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 07:47:32,543 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 07:47:32,543 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 07:47:32,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 07:47:32,544 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 07:47:32,544 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 07:47:32,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 07:47:32,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 07:47:32,549 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 07:47:32,549 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 07:47:32,549 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 07:47:32,550 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 07:47:32,550 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 07:47:32,550 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 07:47:32,550 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 07:47:32,551 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 07:47:32,551 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 07:47:32,551 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 07:47:32,551 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 07:47:32,552 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 07:47:32,552 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 07:47:32,552 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:47:32,553 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 07:47:32,553 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 07:47:32,553 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 07:47:32,553 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 07:47:32,553 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 07:47:32,554 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 07:47:32,555 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 07:47:32,555 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 07:47:32,556 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 07:47:32,556 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 07:47:32,556 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 -> 1099dc6ef8775f885d201a02b7127f0105d58cf8211bece20c4f73890064a48d [2024-10-14 07:47:32,887 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 07:47:32,909 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 07:47:32,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 07:47:32,913 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 07:47:32,914 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 07:47:32,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i [2024-10-14 07:47:34,468 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 07:47:34,718 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 07:47:34,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_steplocals_file-84.i [2024-10-14 07:47:34,734 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccba7499c/89244e0df75843ad9d6a354f9d2706d1/FLAG5972e3c47 [2024-10-14 07:47:35,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ccba7499c/89244e0df75843ad9d6a354f9d2706d1 [2024-10-14 07:47:35,062 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 07:47:35,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 07:47:35,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 07:47:35,067 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 07:47:35,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 07:47:35,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f4354c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35, skipping insertion in model container [2024-10-14 07:47:35,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 07:47:35,270 WARN L248 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_steplocals_file-84.i[917,930] [2024-10-14 07:47:35,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:47:35,341 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 07:47:35,362 WARN L248 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_steplocals_file-84.i[917,930] [2024-10-14 07:47:35,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 07:47:35,434 INFO L204 MainTranslator]: Completed translation [2024-10-14 07:47:35,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35 WrapperNode [2024-10-14 07:47:35,435 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 07:47:35,436 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 07:47:35,436 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 07:47:35,436 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 07:47:35,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,452 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,481 INFO L138 Inliner]: procedures = 27, calls = 39, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 141 [2024-10-14 07:47:35,482 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 07:47:35,483 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 07:47:35,483 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 07:47:35,483 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 07:47:35,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,497 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,509 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-10-14 07:47:35,510 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,510 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,528 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,536 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,539 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,540 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 07:47:35,547 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 07:47:35,547 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 07:47:35,547 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 07:47:35,548 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (1/1) ... [2024-10-14 07:47:35,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 07:47:35,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 07:47:35,578 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-10-14 07:47:35,581 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-10-14 07:47:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 07:47:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 07:47:35,616 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 07:47:35,617 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 07:47:35,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 07:47:35,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 07:47:35,697 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 07:47:35,699 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 07:47:36,176 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-14 07:47:36,176 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 07:47:36,259 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 07:47:36,260 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 07:47:36,260 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:47:36 BoogieIcfgContainer [2024-10-14 07:47:36,261 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 07:47:36,263 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 07:47:36,263 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 07:47:36,266 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 07:47:36,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 07:47:35" (1/3) ... [2024-10-14 07:47:36,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fd3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:47:36, skipping insertion in model container [2024-10-14 07:47:36,268 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 07:47:35" (2/3) ... [2024-10-14 07:47:36,268 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41fd3b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 07:47:36, skipping insertion in model container [2024-10-14 07:47:36,269 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 07:47:36" (3/3) ... [2024-10-14 07:47:36,270 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_steplocals_file-84.i [2024-10-14 07:47:36,288 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 07:47:36,288 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 07:47:36,369 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 07:47:36,378 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;@7c0d215c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 07:47:36,379 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 07:47:36,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:47:36,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 07:47:36,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:47:36,400 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:47:36,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:47:36,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:47:36,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1634077824, now seen corresponding path program 1 times [2024-10-14 07:47:36,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:47:36,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740925383] [2024-10-14 07:47:36,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:47:36,423 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-10-14 07:47:36,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:47:36,426 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-10-14 07:47:36,427 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-10-14 07:47:36,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:36,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 07:47:36,705 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 07:47:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked. [2024-10-14 07:47:36,745 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 07:47:36,746 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 07:47:36,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740925383] [2024-10-14 07:47:36,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740925383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 07:47:36,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 07:47:36,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 07:47:36,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489771173] [2024-10-14 07:47:36,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 07:47:36,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 07:47:36,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 07:47:36,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 07:47:36,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 07:47:36,792 INFO L87 Difference]: Start difference. First operand has 62 states, 33 states have (on average 1.393939393939394) internal successors, (46), 34 states have internal predecessors, (46), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:47:36,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 07:47:36,905 INFO L93 Difference]: Finished difference Result 121 states and 220 transitions. [2024-10-14 07:47:36,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 07:47:36,915 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 156 [2024-10-14 07:47:36,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 07:47:36,921 INFO L225 Difference]: With dead ends: 121 [2024-10-14 07:47:36,921 INFO L226 Difference]: Without dead ends: 60 [2024-10-14 07:47:36,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 155 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-10-14 07:47:36,930 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 07:47:36,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 07:47:36,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2024-10-14 07:47:36,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2024-10-14 07:47:36,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 32 states have (on average 1.28125) internal successors, (41), 32 states have internal predecessors, (41), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-14 07:47:36,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 93 transitions. [2024-10-14 07:47:36,977 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 93 transitions. Word has length 156 [2024-10-14 07:47:36,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 07:47:36,977 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 93 transitions. [2024-10-14 07:47:36,977 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, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-10-14 07:47:36,978 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 93 transitions. [2024-10-14 07:47:36,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-10-14 07:47:36,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 07:47:36,984 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 07:47:36,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 07:47:37,184 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-10-14 07:47:37,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 07:47:37,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 07:47:37,186 INFO L85 PathProgramCache]: Analyzing trace with hash 555812988, now seen corresponding path program 1 times [2024-10-14 07:47:37,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 07:47:37,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [976941641] [2024-10-14 07:47:37,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 07:47:37,188 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-10-14 07:47:37,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 07:47:37,191 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-10-14 07:47:37,192 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-10-14 07:47:37,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 07:47:37,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-14 07:47:37,550 INFO L278 TraceCheckSpWp]: Computing forward predicates...