./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.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 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:48:56,049 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:48:56,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 07:48:56,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:48:56,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:48:56,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:48:56,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:48:56,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:48:56,161 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:48:56,162 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:48:56,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:48:56,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:48:56,164 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:48:56,164 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:48:56,166 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:48:56,166 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:48:56,166 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:48:56,167 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:48:56,167 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 07:48:56,167 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:48:56,167 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:48:56,171 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:48:56,172 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:48:56,172 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:48:56,172 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:48:56,172 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:48:56,172 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:48:56,173 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:48:56,173 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:48:56,173 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:48:56,173 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:48:56,174 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:48:56,174 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:48:56,174 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:48:56,174 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:48:56,174 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:48:56,175 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 07:48:56,175 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 07:48:56,176 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:48:56,177 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:48:56,177 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:48:56,177 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:48:56,178 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 -> 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad [2024-11-10 07:48:56,422 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:48:56,446 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:48:56,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:48:56,450 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:48:56,450 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:48:56,451 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-11-10 07:48:57,908 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:48:58,113 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:48:58,114 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-11-10 07:48:58,127 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c868d160d/cbdbf07816c0427f8d9ef4df818ce6be/FLAGd54a31097 [2024-11-10 07:48:58,142 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c868d160d/cbdbf07816c0427f8d9ef4df818ce6be [2024-11-10 07:48:58,145 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:48:58,146 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:48:58,149 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:48:58,149 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:48:58,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:48:58,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c5794b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58, skipping insertion in model container [2024-11-10 07:48:58,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:48:58,428 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2024-11-10 07:48:58,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:48:58,501 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:48:58,511 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2024-11-10 07:48:58,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:48:58,564 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:48:58,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58 WrapperNode [2024-11-10 07:48:58,566 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:48:58,567 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:48:58,567 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:48:58,568 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:48:58,574 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,621 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-11-10 07:48:58,622 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:48:58,622 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:48:58,623 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:48:58,623 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:48:58,639 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,669 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:48:58,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,670 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,683 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,685 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,687 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,689 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:48:58,696 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:48:58,696 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:48:58,696 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:48:58,697 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (1/1) ... [2024-11-10 07:48:58,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:48:58,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:48:58,743 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:48:58,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:48:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:48:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:48:58,783 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:48:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 07:48:58,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:48:58,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:48:58,855 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:48:58,856 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:48:59,175 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L124: havoc property_#t~bitwise17#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2024-11-10 07:48:59,226 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 07:48:59,230 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:48:59,262 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:48:59,263 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:48:59,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:48:59 BoogieIcfgContainer [2024-11-10 07:48:59,264 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:48:59,266 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:48:59,267 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:48:59,270 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:48:59,271 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:48:58" (1/3) ... [2024-11-10 07:48:59,272 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0f92b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:48:59, skipping insertion in model container [2024-11-10 07:48:59,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:48:58" (2/3) ... [2024-11-10 07:48:59,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f0f92b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:48:59, skipping insertion in model container [2024-11-10 07:48:59,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:48:59" (3/3) ... [2024-11-10 07:48:59,275 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-11-10 07:48:59,293 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:48:59,293 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:48:59,356 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:48:59,363 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;@1cbde377, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:48:59,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:48:59,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 75 states, 56 states have (on average 1.375) internal successors, (77), 57 states have internal predecessors, (77), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:48:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 07:48:59,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:48:59,379 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:48:59,380 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:48:59,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:48:59,384 INFO L85 PathProgramCache]: Analyzing trace with hash -592616479, now seen corresponding path program 1 times [2024-11-10 07:48:59,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:48:59,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146215698] [2024-11-10 07:48:59,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:48:59,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:48:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:48:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:48:59,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:48:59,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:48:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:48:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:48:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:48:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:48:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:48:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:48:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:48:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:48:59,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:48:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:48:59,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:48:59,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:48:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:48:59,888 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:48:59,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:48:59,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146215698] [2024-11-10 07:48:59,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146215698] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:48:59,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:48:59,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:48:59,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001889200] [2024-11-10 07:48:59,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:48:59,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:48:59,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:48:59,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:48:59,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:48:59,927 INFO L87 Difference]: Start difference. First operand has 75 states, 56 states have (on average 1.375) internal successors, (77), 57 states have internal predecessors, (77), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 07:48:59,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:48:59,959 INFO L93 Difference]: Finished difference Result 146 states and 230 transitions. [2024-11-10 07:48:59,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:48:59,962 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 118 [2024-11-10 07:48:59,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:48:59,972 INFO L225 Difference]: With dead ends: 146 [2024-11-10 07:48:59,972 INFO L226 Difference]: Without dead ends: 70 [2024-11-10 07:48:59,976 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:48:59,981 INFO L432 NwaCegarLoop]: 101 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, 101 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-11-10 07:48:59,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:48:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-10 07:49:00,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-10 07:49:00,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 52 states have (on average 1.3269230769230769) internal successors, (69), 52 states have internal predecessors, (69), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:49:00,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 101 transitions. [2024-11-10 07:49:00,023 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 101 transitions. Word has length 118 [2024-11-10 07:49:00,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:00,024 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 101 transitions. [2024-11-10 07:49:00,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 07:49:00,024 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 101 transitions. [2024-11-10 07:49:00,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 07:49:00,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:00,027 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:00,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 07:49:00,028 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:00,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:00,028 INFO L85 PathProgramCache]: Analyzing trace with hash -471719225, now seen corresponding path program 1 times [2024-11-10 07:49:00,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:00,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677009207] [2024-11-10 07:49:00,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:00,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:00,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:00,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:00,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:00,357 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:00,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:00,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677009207] [2024-11-10 07:49:00,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677009207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:00,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:00,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:49:00,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693493267] [2024-11-10 07:49:00,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:00,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:49:00,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:00,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:49:00,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:49:00,366 INFO L87 Difference]: Start difference. First operand 70 states and 101 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:00,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:00,434 INFO L93 Difference]: Finished difference Result 169 states and 244 transitions. [2024-11-10 07:49:00,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:49:00,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-10 07:49:00,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:00,439 INFO L225 Difference]: With dead ends: 169 [2024-11-10 07:49:00,439 INFO L226 Difference]: Without dead ends: 102 [2024-11-10 07:49:00,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:49:00,441 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 35 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:00,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 195 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:49:00,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-10 07:49:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 83. [2024-11-10 07:49:00,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 65 states have (on average 1.353846153846154) internal successors, (88), 65 states have internal predecessors, (88), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:49:00,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 120 transitions. [2024-11-10 07:49:00,458 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 120 transitions. Word has length 118 [2024-11-10 07:49:00,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:00,460 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 120 transitions. [2024-11-10 07:49:00,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:00,463 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 120 transitions. [2024-11-10 07:49:00,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-10 07:49:00,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:00,465 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:00,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 07:49:00,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:00,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:00,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1981703847, now seen corresponding path program 1 times [2024-11-10 07:49:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:00,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338167662] [2024-11-10 07:49:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:01,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:01,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:01,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:01,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:01,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:01,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:01,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:01,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:01,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:01,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:01,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:01,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338167662] [2024-11-10 07:49:01,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338167662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:01,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:01,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:49:01,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116890688] [2024-11-10 07:49:01,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:01,125 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:49:01,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:01,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:49:01,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:49:01,126 INFO L87 Difference]: Start difference. First operand 83 states and 120 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:01,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:01,498 INFO L93 Difference]: Finished difference Result 270 states and 393 transitions. [2024-11-10 07:49:01,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:49:01,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 118 [2024-11-10 07:49:01,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:01,501 INFO L225 Difference]: With dead ends: 270 [2024-11-10 07:49:01,502 INFO L226 Difference]: Without dead ends: 190 [2024-11-10 07:49:01,503 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:49:01,504 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 218 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:01,504 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 337 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:49:01,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-10 07:49:01,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 104. [2024-11-10 07:49:01,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:49:01,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-11-10 07:49:01,527 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 118 [2024-11-10 07:49:01,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:01,528 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-11-10 07:49:01,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:01,528 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-11-10 07:49:01,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-10 07:49:01,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:01,533 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:01,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 07:49:01,533 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:01,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:01,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1830585519, now seen corresponding path program 1 times [2024-11-10 07:49:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:01,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427295108] [2024-11-10 07:49:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:01,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:02,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:02,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:02,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:02,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:02,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:02,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:02,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:02,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:02,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:02,179 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:02,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:02,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427295108] [2024-11-10 07:49:02,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427295108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:02,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:02,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 07:49:02,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310784518] [2024-11-10 07:49:02,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:02,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 07:49:02,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:02,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 07:49:02,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:49:02,185 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:02,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:02,516 INFO L93 Difference]: Finished difference Result 269 states and 391 transitions. [2024-11-10 07:49:02,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:49:02,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 119 [2024-11-10 07:49:02,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:02,519 INFO L225 Difference]: With dead ends: 269 [2024-11-10 07:49:02,519 INFO L226 Difference]: Without dead ends: 168 [2024-11-10 07:49:02,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:49:02,521 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 76 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 884 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:02,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 884 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 273 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 07:49:02,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-10 07:49:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 117. [2024-11-10 07:49:02,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 99 states have (on average 1.393939393939394) internal successors, (138), 99 states have internal predecessors, (138), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:49:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2024-11-10 07:49:02,531 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 119 [2024-11-10 07:49:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:02,532 INFO L471 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2024-11-10 07:49:02,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.25) internal successors, (42), 8 states have internal predecessors, (42), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2024-11-10 07:49:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 07:49:02,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:02,534 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:02,534 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 07:49:02,534 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:02,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:02,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1483513283, now seen corresponding path program 1 times [2024-11-10 07:49:02,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:02,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906173124] [2024-11-10 07:49:02,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:02,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:03,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:03,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:03,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:03,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:03,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:03,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:03,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:03,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:03,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:03,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:03,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:03,094 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:03,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:03,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906173124] [2024-11-10 07:49:03,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906173124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:03,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:03,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 07:49:03,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994409786] [2024-11-10 07:49:03,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:03,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 07:49:03,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:03,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 07:49:03,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:49:03,098 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:03,394 INFO L93 Difference]: Finished difference Result 290 states and 419 transitions. [2024-11-10 07:49:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:49:03,394 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-10 07:49:03,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:03,396 INFO L225 Difference]: With dead ends: 290 [2024-11-10 07:49:03,396 INFO L226 Difference]: Without dead ends: 176 [2024-11-10 07:49:03,398 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:49:03,399 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 70 mSDsluCounter, 705 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 854 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:03,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 854 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:49:03,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2024-11-10 07:49:03,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 127. [2024-11-10 07:49:03,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 109 states have (on average 1.4036697247706422) internal successors, (153), 109 states have internal predecessors, (153), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:49:03,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 185 transitions. [2024-11-10 07:49:03,413 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 185 transitions. Word has length 120 [2024-11-10 07:49:03,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:03,416 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 185 transitions. [2024-11-10 07:49:03,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:03,417 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 185 transitions. [2024-11-10 07:49:03,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-10 07:49:03,418 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:03,418 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:03,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 07:49:03,418 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:03,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:03,419 INFO L85 PathProgramCache]: Analyzing trace with hash 2075905340, now seen corresponding path program 1 times [2024-11-10 07:49:03,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:03,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482394576] [2024-11-10 07:49:03,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:03,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:03,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:04,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:04,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:04,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:04,249 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:04,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:04,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482394576] [2024-11-10 07:49:04,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482394576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:04,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:04,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:49:04,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965514107] [2024-11-10 07:49:04,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:04,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:49:04,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:04,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:49:04,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:49:04,256 INFO L87 Difference]: Start difference. First operand 127 states and 185 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:05,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:05,022 INFO L93 Difference]: Finished difference Result 341 states and 486 transitions. [2024-11-10 07:49:05,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 07:49:05,022 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 120 [2024-11-10 07:49:05,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:05,026 INFO L225 Difference]: With dead ends: 341 [2024-11-10 07:49:05,026 INFO L226 Difference]: Without dead ends: 217 [2024-11-10 07:49:05,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2024-11-10 07:49:05,028 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 172 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:05,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 904 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 07:49:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2024-11-10 07:49:05,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 133. [2024-11-10 07:49:05,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 115 states have (on average 1.3304347826086957) internal successors, (153), 115 states have internal predecessors, (153), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:49:05,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 185 transitions. [2024-11-10 07:49:05,047 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 185 transitions. Word has length 120 [2024-11-10 07:49:05,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:05,047 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 185 transitions. [2024-11-10 07:49:05,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:05,048 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 185 transitions. [2024-11-10 07:49:05,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 07:49:05,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:05,049 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:05,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 07:49:05,050 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:05,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:05,050 INFO L85 PathProgramCache]: Analyzing trace with hash 355188204, now seen corresponding path program 1 times [2024-11-10 07:49:05,050 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:05,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40972395] [2024-11-10 07:49:05,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:05,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:05,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:05,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:05,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:05,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:05,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:05,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:05,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:05,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:05,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:05,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:05,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:05,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:05,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40972395] [2024-11-10 07:49:05,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40972395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:05,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:05,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 07:49:05,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136937507] [2024-11-10 07:49:05,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:05,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 07:49:05,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:05,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 07:49:05,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:49:05,843 INFO L87 Difference]: Start difference. First operand 133 states and 185 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:06,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:06,649 INFO L93 Difference]: Finished difference Result 354 states and 486 transitions. [2024-11-10 07:49:06,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 07:49:06,650 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-10 07:49:06,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:06,653 INFO L225 Difference]: With dead ends: 354 [2024-11-10 07:49:06,653 INFO L226 Difference]: Without dead ends: 224 [2024-11-10 07:49:06,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2024-11-10 07:49:06,654 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 166 mSDsluCounter, 941 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:06,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1103 Invalid, 730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 729 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 07:49:06,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2024-11-10 07:49:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 137. [2024-11-10 07:49:06,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.3277310924369747) internal successors, (158), 119 states have internal predecessors, (158), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:49:06,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 190 transitions. [2024-11-10 07:49:06,663 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 190 transitions. Word has length 121 [2024-11-10 07:49:06,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:06,664 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 190 transitions. [2024-11-10 07:49:06,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:06,664 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 190 transitions. [2024-11-10 07:49:06,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 07:49:06,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:06,665 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:06,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 07:49:06,666 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:06,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:06,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1100131932, now seen corresponding path program 1 times [2024-11-10 07:49:06,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:06,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384876765] [2024-11-10 07:49:06,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:06,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:07,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:07,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:07,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:07,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:07,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:07,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:07,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:07,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:07,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:07,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:07,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:07,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:07,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384876765] [2024-11-10 07:49:07,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384876765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:07,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:07,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-10 07:49:07,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824042353] [2024-11-10 07:49:07,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:07,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 07:49:07,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:07,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 07:49:07,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:49:07,809 INFO L87 Difference]: Start difference. First operand 137 states and 190 transitions. Second operand has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:08,402 INFO L93 Difference]: Finished difference Result 467 states and 627 transitions. [2024-11-10 07:49:08,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 07:49:08,403 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-10 07:49:08,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:08,405 INFO L225 Difference]: With dead ends: 467 [2024-11-10 07:49:08,405 INFO L226 Difference]: Without dead ends: 333 [2024-11-10 07:49:08,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2024-11-10 07:49:08,406 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 224 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:08,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 728 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 07:49:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-11-10 07:49:08,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 249. [2024-11-10 07:49:08,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 228 states have (on average 1.3464912280701755) internal successors, (307), 229 states have internal predecessors, (307), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 07:49:08,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 343 transitions. [2024-11-10 07:49:08,427 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 343 transitions. Word has length 121 [2024-11-10 07:49:08,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:08,428 INFO L471 AbstractCegarLoop]: Abstraction has 249 states and 343 transitions. [2024-11-10 07:49:08,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.6666666666666665) internal successors, (44), 12 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:08,428 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 343 transitions. [2024-11-10 07:49:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 07:49:08,430 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:08,430 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:08,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 07:49:08,430 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:08,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:08,431 INFO L85 PathProgramCache]: Analyzing trace with hash -678881924, now seen corresponding path program 1 times [2024-11-10 07:49:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:08,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457012411] [2024-11-10 07:49:08,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:08,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:08,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:08,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:08,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:08,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:08,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:08,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:08,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:08,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457012411] [2024-11-10 07:49:08,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457012411] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:08,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:08,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:49:08,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231943299] [2024-11-10 07:49:08,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:08,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:49:08,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:08,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:49:08,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:49:08,538 INFO L87 Difference]: Start difference. First operand 249 states and 343 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:08,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:08,584 INFO L93 Difference]: Finished difference Result 657 states and 898 transitions. [2024-11-10 07:49:08,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:49:08,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-10 07:49:08,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:08,590 INFO L225 Difference]: With dead ends: 657 [2024-11-10 07:49:08,590 INFO L226 Difference]: Without dead ends: 411 [2024-11-10 07:49:08,591 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:49:08,593 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 82 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:08,593 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 196 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:49:08,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2024-11-10 07:49:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 283. [2024-11-10 07:49:08,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 262 states have (on average 1.3244274809160306) internal successors, (347), 263 states have internal predecessors, (347), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 07:49:08,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 383 transitions. [2024-11-10 07:49:08,612 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 383 transitions. Word has length 121 [2024-11-10 07:49:08,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:08,613 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 383 transitions. [2024-11-10 07:49:08,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 383 transitions. [2024-11-10 07:49:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 07:49:08,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:08,615 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:08,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 07:49:08,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:08,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:08,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1592484815, now seen corresponding path program 1 times [2024-11-10 07:49:08,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:08,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601181255] [2024-11-10 07:49:08,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:08,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:08,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:08,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:08,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:08,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:08,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:08,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:08,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:08,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:08,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:08,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:08,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:08,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:08,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:08,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,694 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:08,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:08,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601181255] [2024-11-10 07:49:08,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601181255] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:08,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:08,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:49:08,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531542726] [2024-11-10 07:49:08,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:08,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:49:08,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:08,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:49:08,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:49:08,696 INFO L87 Difference]: Start difference. First operand 283 states and 383 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:08,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:08,741 INFO L93 Difference]: Finished difference Result 684 states and 919 transitions. [2024-11-10 07:49:08,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:49:08,742 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-10 07:49:08,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:08,745 INFO L225 Difference]: With dead ends: 684 [2024-11-10 07:49:08,745 INFO L226 Difference]: Without dead ends: 404 [2024-11-10 07:49:08,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:49:08,748 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 85 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:08,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 190 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:49:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2024-11-10 07:49:08,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 335. [2024-11-10 07:49:08,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 314 states have (on average 1.3121019108280254) internal successors, (412), 315 states have internal predecessors, (412), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 07:49:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 448 transitions. [2024-11-10 07:49:08,764 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 448 transitions. Word has length 121 [2024-11-10 07:49:08,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:08,764 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 448 transitions. [2024-11-10 07:49:08,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 448 transitions. [2024-11-10 07:49:08,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 07:49:08,766 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:08,766 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:08,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 07:49:08,766 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:08,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:08,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1013486799, now seen corresponding path program 1 times [2024-11-10 07:49:08,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:08,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970749940] [2024-11-10 07:49:08,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:08,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:08,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:08,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:08,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:08,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:08,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:08,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:08,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:08,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:08,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:08,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:08,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:08,885 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:08,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970749940] [2024-11-10 07:49:08,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970749940] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:08,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:08,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:49:08,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87774946] [2024-11-10 07:49:08,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:08,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:49:08,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:08,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:49:08,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:49:08,888 INFO L87 Difference]: Start difference. First operand 335 states and 448 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:08,937 INFO L93 Difference]: Finished difference Result 734 states and 978 transitions. [2024-11-10 07:49:08,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:49:08,938 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-10 07:49:08,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:08,940 INFO L225 Difference]: With dead ends: 734 [2024-11-10 07:49:08,940 INFO L226 Difference]: Without dead ends: 402 [2024-11-10 07:49:08,940 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:49:08,941 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 78 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:08,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 169 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:49:08,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2024-11-10 07:49:08,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 335. [2024-11-10 07:49:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 314 states have (on average 1.305732484076433) internal successors, (410), 315 states have internal predecessors, (410), 18 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-10 07:49:08,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 446 transitions. [2024-11-10 07:49:08,960 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 446 transitions. Word has length 121 [2024-11-10 07:49:08,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:08,961 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 446 transitions. [2024-11-10 07:49:08,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:08,961 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 446 transitions. [2024-11-10 07:49:08,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-10 07:49:08,963 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:08,963 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:08,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 07:49:08,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:08,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:08,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1033125179, now seen corresponding path program 1 times [2024-11-10 07:49:08,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:08,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314427945] [2024-11-10 07:49:08,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:08,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:09,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:09,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:09,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:09,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:09,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:09,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:09,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:09,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:09,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:09,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:09,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,207 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:09,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:09,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314427945] [2024-11-10 07:49:09,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314427945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:09,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:09,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:49:09,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337959229] [2024-11-10 07:49:09,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:09,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:49:09,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:09,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:49:09,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:49:09,210 INFO L87 Difference]: Start difference. First operand 335 states and 446 transitions. Second operand has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:09,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:09,504 INFO L93 Difference]: Finished difference Result 858 states and 1151 transitions. [2024-11-10 07:49:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 07:49:09,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 121 [2024-11-10 07:49:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:09,508 INFO L225 Difference]: With dead ends: 858 [2024-11-10 07:49:09,508 INFO L226 Difference]: Without dead ends: 526 [2024-11-10 07:49:09,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:49:09,510 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 125 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:09,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 401 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:49:09,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2024-11-10 07:49:09,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 519. [2024-11-10 07:49:09,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 463 states have (on average 1.285097192224622) internal successors, (595), 465 states have internal predecessors, (595), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 07:49:09,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 695 transitions. [2024-11-10 07:49:09,544 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 695 transitions. Word has length 121 [2024-11-10 07:49:09,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:09,546 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 695 transitions. [2024-11-10 07:49:09,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 5 states have internal predecessors, (44), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:09,547 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 695 transitions. [2024-11-10 07:49:09,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 07:49:09,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:09,549 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:09,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 07:49:09,549 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:09,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:09,550 INFO L85 PathProgramCache]: Analyzing trace with hash 768441574, now seen corresponding path program 1 times [2024-11-10 07:49:09,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:09,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734637832] [2024-11-10 07:49:09,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:09,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:09,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:09,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:09,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:09,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:09,972 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:09,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:09,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734637832] [2024-11-10 07:49:09,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734637832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:09,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:09,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 07:49:09,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849418042] [2024-11-10 07:49:09,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:09,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 07:49:09,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:09,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 07:49:09,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:49:09,974 INFO L87 Difference]: Start difference. First operand 519 states and 695 transitions. Second operand has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:10,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:10,243 INFO L93 Difference]: Finished difference Result 1026 states and 1349 transitions. [2024-11-10 07:49:10,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:49:10,244 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 07:49:10,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:10,247 INFO L225 Difference]: With dead ends: 1026 [2024-11-10 07:49:10,247 INFO L226 Difference]: Without dead ends: 694 [2024-11-10 07:49:10,248 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-10 07:49:10,249 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 81 mSDsluCounter, 698 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:10,249 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 822 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:49:10,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-10 07:49:10,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 525. [2024-11-10 07:49:10,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 469 states have (on average 1.2857142857142858) internal successors, (603), 471 states have internal predecessors, (603), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 07:49:10,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 703 transitions. [2024-11-10 07:49:10,280 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 703 transitions. Word has length 122 [2024-11-10 07:49:10,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:10,280 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 703 transitions. [2024-11-10 07:49:10,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.5) internal successors, (45), 10 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:10,281 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 703 transitions. [2024-11-10 07:49:10,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 07:49:10,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:10,283 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:10,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 07:49:10,283 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:10,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:10,284 INFO L85 PathProgramCache]: Analyzing trace with hash -121454523, now seen corresponding path program 1 times [2024-11-10 07:49:10,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:10,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413304825] [2024-11-10 07:49:10,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:10,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:10,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:10,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:10,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:10,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:10,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:10,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:10,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:10,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:10,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:10,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:10,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413304825] [2024-11-10 07:49:10,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413304825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:10,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:10,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 07:49:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658201997] [2024-11-10 07:49:10,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:10,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 07:49:10,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:10,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 07:49:10,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 07:49:10,911 INFO L87 Difference]: Start difference. First operand 525 states and 703 transitions. Second operand has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:11,271 INFO L93 Difference]: Finished difference Result 928 states and 1232 transitions. [2024-11-10 07:49:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 07:49:11,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 07:49:11,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:11,274 INFO L225 Difference]: With dead ends: 928 [2024-11-10 07:49:11,274 INFO L226 Difference]: Without dead ends: 590 [2024-11-10 07:49:11,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-10 07:49:11,276 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 118 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:11,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 549 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:49:11,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2024-11-10 07:49:11,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 533. [2024-11-10 07:49:11,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 477 states have (on average 1.2893081761006289) internal successors, (615), 479 states have internal predecessors, (615), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 07:49:11,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 715 transitions. [2024-11-10 07:49:11,305 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 715 transitions. Word has length 122 [2024-11-10 07:49:11,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:11,306 INFO L471 AbstractCegarLoop]: Abstraction has 533 states and 715 transitions. [2024-11-10 07:49:11,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.625) internal successors, (45), 8 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:11,306 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 715 transitions. [2024-11-10 07:49:11,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 07:49:11,307 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:11,308 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:11,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 07:49:11,308 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:11,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:11,309 INFO L85 PathProgramCache]: Analyzing trace with hash 10230261, now seen corresponding path program 1 times [2024-11-10 07:49:11,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:11,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031304785] [2024-11-10 07:49:11,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:11,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:11,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:11,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:11,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:11,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:11,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:11,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,378 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:11,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:11,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031304785] [2024-11-10 07:49:11,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031304785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:11,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:11,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:49:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844904536] [2024-11-10 07:49:11,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:11,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:49:11,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:11,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:49:11,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:49:11,381 INFO L87 Difference]: Start difference. First operand 533 states and 715 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:11,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:11,443 INFO L93 Difference]: Finished difference Result 1159 states and 1553 transitions. [2024-11-10 07:49:11,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:49:11,444 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 07:49:11,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:11,447 INFO L225 Difference]: With dead ends: 1159 [2024-11-10 07:49:11,447 INFO L226 Difference]: Without dead ends: 666 [2024-11-10 07:49:11,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:49:11,449 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 76 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:11,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 242 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:49:11,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2024-11-10 07:49:11,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 504. [2024-11-10 07:49:11,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 504 states, 448 states have (on average 1.2700892857142858) internal successors, (569), 450 states have internal predecessors, (569), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 07:49:11,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 504 states to 504 states and 669 transitions. [2024-11-10 07:49:11,521 INFO L78 Accepts]: Start accepts. Automaton has 504 states and 669 transitions. Word has length 122 [2024-11-10 07:49:11,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:11,521 INFO L471 AbstractCegarLoop]: Abstraction has 504 states and 669 transitions. [2024-11-10 07:49:11,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:11,522 INFO L276 IsEmpty]: Start isEmpty. Operand 504 states and 669 transitions. [2024-11-10 07:49:11,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 07:49:11,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:11,523 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:11,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 07:49:11,524 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:11,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:11,525 INFO L85 PathProgramCache]: Analyzing trace with hash 695375573, now seen corresponding path program 1 times [2024-11-10 07:49:11,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:11,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62991994] [2024-11-10 07:49:11,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:11,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:11,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:11,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:11,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:11,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:11,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:11,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:11,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:11,702 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:11,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:11,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62991994] [2024-11-10 07:49:11,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [62991994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:11,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:11,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:49:11,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408235915] [2024-11-10 07:49:11,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:11,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 07:49:11,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:11,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 07:49:11,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:49:11,707 INFO L87 Difference]: Start difference. First operand 504 states and 669 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:11,859 INFO L93 Difference]: Finished difference Result 1038 states and 1383 transitions. [2024-11-10 07:49:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 07:49:11,859 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 07:49:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:11,863 INFO L225 Difference]: With dead ends: 1038 [2024-11-10 07:49:11,863 INFO L226 Difference]: Without dead ends: 574 [2024-11-10 07:49:11,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 07:49:11,866 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 179 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:11,867 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 181 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:49:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-11-10 07:49:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 443. [2024-11-10 07:49:11,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 387 states have (on average 1.2428940568475453) internal successors, (481), 389 states have internal predecessors, (481), 50 states have call successors, (50), 5 states have call predecessors, (50), 5 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2024-11-10 07:49:11,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 581 transitions. [2024-11-10 07:49:11,905 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 581 transitions. Word has length 122 [2024-11-10 07:49:11,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:11,905 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 581 transitions. [2024-11-10 07:49:11,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:11,905 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 581 transitions. [2024-11-10 07:49:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 07:49:11,907 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:11,907 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:11,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 07:49:11,908 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:11,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:11,908 INFO L85 PathProgramCache]: Analyzing trace with hash 723017348, now seen corresponding path program 1 times [2024-11-10 07:49:11,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:11,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664430541] [2024-11-10 07:49:11,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:11,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:12,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:12,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:12,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:12,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:12,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:12,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:12,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664430541] [2024-11-10 07:49:12,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664430541] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:12,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:12,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 07:49:12,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401454674] [2024-11-10 07:49:12,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:12,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 07:49:12,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:12,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 07:49:12,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:49:12,400 INFO L87 Difference]: Start difference. First operand 443 states and 581 transitions. Second operand has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:12,732 INFO L93 Difference]: Finished difference Result 751 states and 973 transitions. [2024-11-10 07:49:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 07:49:12,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 07:49:12,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:12,738 INFO L225 Difference]: With dead ends: 751 [2024-11-10 07:49:12,738 INFO L226 Difference]: Without dead ends: 473 [2024-11-10 07:49:12,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2024-11-10 07:49:12,740 INFO L432 NwaCegarLoop]: 113 mSDtfsCounter, 209 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:12,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 324 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 07:49:12,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-10 07:49:12,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 457. [2024-11-10 07:49:12,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 395 states have (on average 1.2354430379746835) internal successors, (488), 398 states have internal predecessors, (488), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 07:49:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 596 transitions. [2024-11-10 07:49:12,787 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 596 transitions. Word has length 122 [2024-11-10 07:49:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:12,789 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 596 transitions. [2024-11-10 07:49:12,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.428571428571429) internal successors, (45), 7 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 596 transitions. [2024-11-10 07:49:12,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 07:49:12,791 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:12,791 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:12,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 07:49:12,792 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:12,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:12,792 INFO L85 PathProgramCache]: Analyzing trace with hash -256198323, now seen corresponding path program 1 times [2024-11-10 07:49:12,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:12,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724325593] [2024-11-10 07:49:12,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:12,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:13,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:13,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:13,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:13,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:13,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:13,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:13,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:13,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:13,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:13,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:13,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:13,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724325593] [2024-11-10 07:49:13,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724325593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:13,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:13,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:49:13,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207865860] [2024-11-10 07:49:13,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:13,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:49:13,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:13,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:49:13,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:49:13,161 INFO L87 Difference]: Start difference. First operand 457 states and 596 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:13,368 INFO L93 Difference]: Finished difference Result 846 states and 1094 transitions. [2024-11-10 07:49:13,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:49:13,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 07:49:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:13,372 INFO L225 Difference]: With dead ends: 846 [2024-11-10 07:49:13,372 INFO L226 Difference]: Without dead ends: 554 [2024-11-10 07:49:13,373 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:49:13,374 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 92 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:13,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 317 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:49:13,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2024-11-10 07:49:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 459. [2024-11-10 07:49:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 397 states have (on average 1.234256926952141) internal successors, (490), 399 states have internal predecessors, (490), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 07:49:13,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 598 transitions. [2024-11-10 07:49:13,427 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 598 transitions. Word has length 122 [2024-11-10 07:49:13,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:13,428 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 598 transitions. [2024-11-10 07:49:13,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:13,428 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 598 transitions. [2024-11-10 07:49:13,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 07:49:13,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:13,429 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:13,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 07:49:13,430 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:13,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:13,430 INFO L85 PathProgramCache]: Analyzing trace with hash 2096303430, now seen corresponding path program 1 times [2024-11-10 07:49:13,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:13,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000752665] [2024-11-10 07:49:13,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:13,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:13,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 07:49:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 07:49:13,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 07:49:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 07:49:13,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 07:49:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 07:49:13,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 07:49:13,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-10 07:49:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 07:49:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 07:49:13,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-10 07:49:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-10 07:49:13,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-10 07:49:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-10 07:49:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-10 07:49:13,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-10 07:49:13,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:13,590 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:13,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 07:49:13,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000752665] [2024-11-10 07:49:13,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000752665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:13,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:13,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 07:49:13,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797693720] [2024-11-10 07:49:13,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:13,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:49:13,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 07:49:13,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:49:13,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:49:13,592 INFO L87 Difference]: Start difference. First operand 459 states and 598 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:13,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:13,699 INFO L93 Difference]: Finished difference Result 879 states and 1142 transitions. [2024-11-10 07:49:13,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:49:13,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 122 [2024-11-10 07:49:13,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:13,703 INFO L225 Difference]: With dead ends: 879 [2024-11-10 07:49:13,703 INFO L226 Difference]: Without dead ends: 462 [2024-11-10 07:49:13,704 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:49:13,705 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 67 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:13,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 341 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 07:49:13,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-10 07:49:13,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 459. [2024-11-10 07:49:13,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 397 states have (on average 1.2292191435768263) internal successors, (488), 399 states have internal predecessors, (488), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-11-10 07:49:13,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 596 transitions. [2024-11-10 07:49:13,753 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 596 transitions. Word has length 122 [2024-11-10 07:49:13,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:13,753 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 596 transitions. [2024-11-10 07:49:13,753 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:13,753 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 596 transitions. [2024-11-10 07:49:13,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-10 07:49:13,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:13,754 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:13,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 07:49:13,755 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:13,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:13,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1354191995, now seen corresponding path program 1 times [2024-11-10 07:49:13,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 07:49:13,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950162316] [2024-11-10 07:49:13,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:13,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 07:49:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:49:13,801 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 07:49:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 07:49:13,896 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 07:49:13,899 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 07:49:13,900 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 07:49:13,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 07:49:13,905 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:14,013 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 07:49:14,018 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 07:49:14 BoogieIcfgContainer [2024-11-10 07:49:14,018 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 07:49:14,019 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 07:49:14,019 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 07:49:14,019 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 07:49:14,020 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:48:59" (3/4) ... [2024-11-10 07:49:14,022 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 07:49:14,023 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 07:49:14,024 INFO L158 Benchmark]: Toolchain (without parser) took 15877.73ms. Allocated memory was 157.3MB in the beginning and 465.6MB in the end (delta: 308.3MB). Free memory was 102.5MB in the beginning and 189.5MB in the end (delta: -87.0MB). Peak memory consumption was 220.9MB. Max. memory is 16.1GB. [2024-11-10 07:49:14,024 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:49:14,025 INFO L158 Benchmark]: CACSL2BoogieTranslator took 416.95ms. Allocated memory is still 157.3MB. Free memory was 102.5MB in the beginning and 121.1MB in the end (delta: -18.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 07:49:14,025 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.15ms. Allocated memory is still 157.3MB. Free memory was 121.1MB in the beginning and 117.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:49:14,025 INFO L158 Benchmark]: Boogie Preprocessor took 72.93ms. Allocated memory is still 157.3MB. Free memory was 117.5MB in the beginning and 112.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 07:49:14,025 INFO L158 Benchmark]: IcfgBuilder took 567.67ms. Allocated memory is still 157.3MB. Free memory was 112.2MB in the beginning and 88.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-10 07:49:14,026 INFO L158 Benchmark]: TraceAbstraction took 14751.76ms. Allocated memory was 157.3MB in the beginning and 465.6MB in the end (delta: 308.3MB). Free memory was 87.6MB in the beginning and 189.5MB in the end (delta: -102.0MB). Peak memory consumption was 207.4MB. Max. memory is 16.1GB. [2024-11-10 07:49:14,026 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 465.6MB. Free memory is still 189.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 07:49:14,030 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.18ms. Allocated memory is still 96.5MB. Free memory is still 50.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 416.95ms. Allocated memory is still 157.3MB. Free memory was 102.5MB in the beginning and 121.1MB in the end (delta: -18.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.15ms. Allocated memory is still 157.3MB. Free memory was 121.1MB in the beginning and 117.5MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 72.93ms. Allocated memory is still 157.3MB. Free memory was 117.5MB in the beginning and 112.7MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 567.67ms. Allocated memory is still 157.3MB. Free memory was 112.2MB in the beginning and 88.1MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14751.76ms. Allocated memory was 157.3MB in the beginning and 465.6MB in the end (delta: 308.3MB). Free memory was 87.6MB in the beginning and 189.5MB in the end (delta: -102.0MB). Peak memory consumption was 207.4MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 465.6MB. Free memory is still 189.5MB. 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 124, overapproximation of someBinaryFLOATComparisonOperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; VAL [isInitial=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L128] isInitial = 1 [L129] FCALL initially() [L130] int k_loop; [L131] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L131] COND TRUE k_loop < 1 [L132] CALL updateLastVariables() [L120] last_1_var_1_1 = var_1_1 [L121] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L132] RET updateLastVariables() [L133] CALL updateVariables() [L91] var_1_7 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L92] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L93] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_15 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_16 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] var_1_18 = __VERIFIER_nondet_double() [L101] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] var_1_19 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] var_1_20 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] var_1_21 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] var_1_22 = __VERIFIER_nondet_double() [L109] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] var_1_23 = __VERIFIER_nondet_double() [L111] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_27 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L115] var_1_28 = __VERIFIER_nondet_char() [L116] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L116] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L117] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L133] RET updateVariables() [L134] CALL step() [L48] signed long int stepLocal_1 = last_1_var_1_1; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L49] COND FALSE !(stepLocal_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L52] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L53] COND FALSE !(\read(var_1_7)) [L56] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L58] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L61] var_1_32 = var_1_16 [L62] var_1_30 = var_1_32 [L63] unsigned char stepLocal_0 = var_1_13; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L64] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_0=64, var_1_11=500, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L64] COND TRUE (var_1_32 >> var_1_32) < stepLocal_0 [L65] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L67] COND TRUE var_1_11 >= var_1_30 [L68] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L70] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L70] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L71] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L79] unsigned short int stepLocal_2 = var_1_30; VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=10, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L80] COND TRUE ! var_1_7 [L81] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, stepLocal_2=0, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L134] RET step() [L135] CALL, EXPR property() [L124] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L124-L125] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L135] RET, EXPR property() [L135] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=0, var_1_13=64, var_1_15=64, var_1_16=-256, var_1_17=505, var_1_1=8, var_1_22=505, var_1_24=-64, var_1_26=4, var_1_27=4, var_1_28=0, var_1_29=31897/500, var_1_30=0, var_1_31=64, var_1_32=-256, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 75 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 20, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2153 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2153 mSDsluCounter, 8838 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6385 mSDsCounter, 229 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3572 IncrementalHoareTripleChecker+Invalid, 3801 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 229 mSolverCounterUnsat, 2453 mSDtfsCounter, 3572 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 795 GetRequests, 686 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=533occurred in iteration=14, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 1364 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 7.3s InterpolantComputationTime, 2415 NumberOfCodeBlocks, 2415 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2274 ConstructedInterpolants, 0 QuantifiedInterpolants, 6567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 9120/9120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 07:49:14,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.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 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 07:49:16,441 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 07:49:16,529 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 07:49:16,538 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 07:49:16,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 07:49:16,571 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 07:49:16,572 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 07:49:16,573 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 07:49:16,573 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 07:49:16,575 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 07:49:16,575 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 07:49:16,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 07:49:16,576 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 07:49:16,577 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 07:49:16,578 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 07:49:16,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 07:49:16,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 07:49:16,580 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 07:49:16,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 07:49:16,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 07:49:16,581 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 07:49:16,584 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 07:49:16,585 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 07:49:16,585 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 07:49:16,585 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 07:49:16,585 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 07:49:16,586 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 07:49:16,586 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 07:49:16,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 07:49:16,586 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 07:49:16,587 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 07:49:16,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 07:49:16,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 07:49:16,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 07:49:16,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:49:16,588 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 07:49:16,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 07:49:16,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 07:49:16,591 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 07:49:16,592 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 07:49:16,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 07:49:16,593 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 07:49:16,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 07:49:16,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 07:49:16,594 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 -> 8f8bcfdb6015d440e6a1a4eaadd74459c55c3a05418feb55db2c008576c462ad [2024-11-10 07:49:16,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 07:49:16,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 07:49:16,986 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 07:49:16,988 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 07:49:16,988 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 07:49:16,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-11-10 07:49:18,662 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 07:49:18,859 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 07:49:18,861 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-11-10 07:49:18,876 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5b58ac4/e8b585a84a0947779e77e6bc230a919e/FLAG690432579 [2024-11-10 07:49:18,895 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d5b58ac4/e8b585a84a0947779e77e6bc230a919e [2024-11-10 07:49:18,898 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 07:49:18,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 07:49:18,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 07:49:18,904 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 07:49:18,909 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 07:49:18,910 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:49:18" (1/1) ... [2024-11-10 07:49:18,910 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@31b6e0f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:18, skipping insertion in model container [2024-11-10 07:49:18,911 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 07:49:18" (1/1) ... [2024-11-10 07:49:18,938 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 07:49:19,136 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2024-11-10 07:49:19,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:49:19,241 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 07:49:19,257 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_50-1loop_file-63.i[915,928] [2024-11-10 07:49:19,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 07:49:19,319 INFO L204 MainTranslator]: Completed translation [2024-11-10 07:49:19,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19 WrapperNode [2024-11-10 07:49:19,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 07:49:19,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 07:49:19,322 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 07:49:19,322 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 07:49:19,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (1/1) ... [2024-11-10 07:49:19,348 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (1/1) ... [2024-11-10 07:49:19,383 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-11-10 07:49:19,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 07:49:19,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 07:49:19,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 07:49:19,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 07:49:19,403 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (1/1) ... [2024-11-10 07:49:19,404 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (1/1) ... [2024-11-10 07:49:19,408 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (1/1) ... [2024-11-10 07:49:19,432 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 07:49:19,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (1/1) ... [2024-11-10 07:49:19,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (1/1) ... [2024-11-10 07:49:19,445 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (1/1) ... [2024-11-10 07:49:19,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (1/1) ... [2024-11-10 07:49:19,452 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (1/1) ... [2024-11-10 07:49:19,454 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (1/1) ... [2024-11-10 07:49:19,461 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 07:49:19,464 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 07:49:19,465 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 07:49:19,465 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 07:49:19,466 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (1/1) ... [2024-11-10 07:49:19,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 07:49:19,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 07:49:19,500 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 07:49:19,506 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 07:49:19,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 07:49:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 07:49:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 07:49:19,555 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 07:49:19,555 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 07:49:19,556 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 07:49:19,665 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 07:49:19,670 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 07:49:25,425 INFO L? ?]: Removed 15 outVars from TransFormulas that were not future-live. [2024-11-10 07:49:25,426 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 07:49:25,442 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 07:49:25,443 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 07:49:25,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:49:25 BoogieIcfgContainer [2024-11-10 07:49:25,444 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 07:49:25,446 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 07:49:25,446 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 07:49:25,450 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 07:49:25,450 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 07:49:18" (1/3) ... [2024-11-10 07:49:25,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b11f848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:49:25, skipping insertion in model container [2024-11-10 07:49:25,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 07:49:19" (2/3) ... [2024-11-10 07:49:25,452 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b11f848 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 07:49:25, skipping insertion in model container [2024-11-10 07:49:25,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 07:49:25" (3/3) ... [2024-11-10 07:49:25,454 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_50-1loop_file-63.i [2024-11-10 07:49:25,470 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 07:49:25,470 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 07:49:25,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 07:49:25,536 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;@10d69f77, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 07:49:25,537 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 07:49:25,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:49:25,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 07:49:25,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:25,576 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:25,577 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:25,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:25,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1462991310, now seen corresponding path program 1 times [2024-11-10 07:49:25,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:49:25,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406111358] [2024-11-10 07:49:25,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:25,600 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:49:25,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:49:25,604 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:49:25,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 07:49:25,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:25,979 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 07:49:25,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:49:26,033 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2024-11-10 07:49:26,034 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:49:26,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:49:26,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406111358] [2024-11-10 07:49:26,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406111358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:26,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:26,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 07:49:26,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355909784] [2024-11-10 07:49:26,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:26,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 07:49:26,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:49:26,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 07:49:26,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:49:26,072 INFO L87 Difference]: Start difference. First operand has 61 states, 42 states have (on average 1.3333333333333333) internal successors, (56), 43 states have internal predecessors, (56), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 07:49:26,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:26,105 INFO L93 Difference]: Finished difference Result 118 states and 188 transitions. [2024-11-10 07:49:26,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 07:49:26,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 112 [2024-11-10 07:49:26,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:26,115 INFO L225 Difference]: With dead ends: 118 [2024-11-10 07:49:26,116 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 07:49:26,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 07:49:26,125 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:26,128 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 07:49:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 07:49:26,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-10 07:49:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-10 07:49:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2024-11-10 07:49:26,190 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 112 [2024-11-10 07:49:26,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:26,191 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2024-11-10 07:49:26,192 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-10 07:49:26,192 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2024-11-10 07:49:26,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 07:49:26,196 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:26,196 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:26,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-10 07:49:26,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:49:26,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:26,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:26,399 INFO L85 PathProgramCache]: Analyzing trace with hash 419618100, now seen corresponding path program 1 times [2024-11-10 07:49:26,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:49:26,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815825357] [2024-11-10 07:49:26,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:26,400 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:49:26,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:49:26,403 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:49:26,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 07:49:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:26,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-10 07:49:26,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:49:28,295 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:28,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:49:28,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:49:28,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815825357] [2024-11-10 07:49:28,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815825357] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:28,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:28,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 07:49:28,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262749442] [2024-11-10 07:49:28,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:28,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 07:49:28,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:49:28,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 07:49:28,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 07:49:28,300 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:32,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:49:33,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:49:33,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:33,312 INFO L93 Difference]: Finished difference Result 164 states and 236 transitions. [2024-11-10 07:49:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 07:49:33,338 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-10 07:49:33,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:33,341 INFO L225 Difference]: With dead ends: 164 [2024-11-10 07:49:33,341 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 07:49:33,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-10 07:49:33,344 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 60 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:33,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 252 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-10 07:49:33,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 07:49:33,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 91. [2024-11-10 07:49:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 56 states have internal predecessors, (66), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 07:49:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-11-10 07:49:33,368 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 112 [2024-11-10 07:49:33,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:33,369 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-11-10 07:49:33,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:33,369 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-11-10 07:49:33,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 07:49:33,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:33,371 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:33,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 07:49:33,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:49:33,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:33,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:33,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1927169909, now seen corresponding path program 1 times [2024-11-10 07:49:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:49:33,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [359306858] [2024-11-10 07:49:33,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:33,574 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:49:33,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:49:33,576 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:49:33,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 07:49:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:33,885 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 07:49:33,889 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 07:49:33,952 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-10 07:49:33,952 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 07:49:33,952 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 07:49:33,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [359306858] [2024-11-10 07:49:33,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [359306858] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 07:49:33,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 07:49:33,953 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 07:49:33,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682911572] [2024-11-10 07:49:33,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 07:49:33,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 07:49:33,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 07:49:33,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 07:49:33,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:49:33,956 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:35,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-10 07:49:35,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 07:49:35,843 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2024-11-10 07:49:35,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 07:49:35,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 112 [2024-11-10 07:49:35,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 07:49:35,847 INFO L225 Difference]: With dead ends: 162 [2024-11-10 07:49:35,847 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 07:49:35,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 07:49:35,849 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 16 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-10 07:49:35,849 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 151 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-10 07:49:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 07:49:35,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2024-11-10 07:49:35,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 64 states have (on average 1.203125) internal successors, (77), 64 states have internal predecessors, (77), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-10 07:49:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 141 transitions. [2024-11-10 07:49:35,884 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 141 transitions. Word has length 112 [2024-11-10 07:49:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 07:49:35,885 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 141 transitions. [2024-11-10 07:49:35,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-10 07:49:35,886 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 141 transitions. [2024-11-10 07:49:35,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-10 07:49:35,890 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 07:49:35,891 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 07:49:35,906 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-10 07:49:36,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:49:36,092 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 07:49:36,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 07:49:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1762849621, now seen corresponding path program 1 times [2024-11-10 07:49:36,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 07:49:36,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [657147360] [2024-11-10 07:49:36,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 07:49:36,093 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 07:49:36,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 07:49:36,097 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 07:49:36,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-10 07:49:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 07:49:36,455 INFO L255 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-10 07:49:36,462 INFO L278 TraceCheckSpWp]: Computing forward predicates...