/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:56:31,058 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:56:31,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 15:56:31,121 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:56:31,121 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:56:31,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:56:31,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:56:31,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:56:31,135 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:56:31,135 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:56:31,136 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:56:31,136 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:56:31,136 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:56:31,136 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:56:31,137 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:56:31,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:56:31,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:56:31,137 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:56:31,138 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:56:31,138 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:56:31,138 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:56:31,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:56:31,139 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:56:31,139 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:56:31,139 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:56:31,140 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:56:31,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:56:31,140 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:56:31,140 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:56:31,140 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:56:31,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:56:31,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:56:31,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:56:31,141 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:56:31,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:56:31,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:56:31,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:56:31,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:56:31,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:56:31,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:56:31,143 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:56:31,143 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:56:31,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:56:31,143 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: Use bitabs translation -> true [2023-12-19 15:56:31,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:56:31,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:56:31,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:56:31,325 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:56:31,325 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:56:31,326 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i [2023-12-19 15:56:32,495 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:56:32,684 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:56:32,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i [2023-12-19 15:56:32,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f461fb8/e814e17dba0a44a9b937687e39351cad/FLAG5414dfe25 [2023-12-19 15:56:33,068 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/69f461fb8/e814e17dba0a44a9b937687e39351cad [2023-12-19 15:56:33,070 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:56:33,071 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:56:33,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:56:33,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:56:33,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:56:33,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a47c31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33, skipping insertion in model container [2023-12-19 15:56:33,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,112 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:56:33,217 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i[917,930] [2023-12-19 15:56:33,266 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:56:33,280 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:56:33,289 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-15.i[917,930] [2023-12-19 15:56:33,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:56:33,335 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:56:33,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33 WrapperNode [2023-12-19 15:56:33,337 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:56:33,338 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:56:33,339 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:56:33,339 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:56:33,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,361 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,386 INFO L138 Inliner]: procedures = 29, calls = 151, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 505 [2023-12-19 15:56:33,387 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:56:33,388 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:56:33,388 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:56:33,388 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:56:33,397 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,397 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,405 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,438 INFO L175 MemorySlicer]: Split 127 memory accesses to 2 slices as follows [2, 125]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2023-12-19 15:56:33,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,465 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,466 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,468 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,471 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:56:33,471 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:56:33,472 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:56:33,472 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:56:33,488 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (1/1) ... [2023-12-19 15:56:33,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:56:33,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:56:33,526 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) [2023-12-19 15:56:33,531 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 [2023-12-19 15:56:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:56:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:56:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:56:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:56:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:56:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:56:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:56:33,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:56:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:56:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:56:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:56:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:56:33,548 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:56:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:56:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:56:33,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:56:33,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:56:33,638 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:56:33,640 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:56:34,065 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:56:34,096 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:56:34,096 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:56:34,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:56:34 BoogieIcfgContainer [2023-12-19 15:56:34,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:56:34,098 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:56:34,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:56:34,101 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:56:34,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:56:33" (1/3) ... [2023-12-19 15:56:34,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c97e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:56:34, skipping insertion in model container [2023-12-19 15:56:34,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:56:33" (2/3) ... [2023-12-19 15:56:34,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c97e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:56:34, skipping insertion in model container [2023-12-19 15:56:34,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:56:34" (3/3) ... [2023-12-19 15:56:34,103 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-15.i [2023-12-19 15:56:34,114 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:56:34,115 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:56:34,145 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:56:34,150 INFO L357 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, mHoare=true, 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;@1f94ef7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:56:34,150 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:56:34,155 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:34,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:56:34,165 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:34,165 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:34,166 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:34,169 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:34,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1552049095, now seen corresponding path program 1 times [2023-12-19 15:56:34,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:34,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488074260] [2023-12-19 15:56:34,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:34,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:34,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:34,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:34,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:34,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:34,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:34,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:34,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:34,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488074260] [2023-12-19 15:56:34,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488074260] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:34,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:34,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:56:34,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911375296] [2023-12-19 15:56:34,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:34,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:56:34,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:34,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:56:34,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:56:34,511 INFO L87 Difference]: Start difference. First operand has 106 states, 91 states have (on average 1.4835164835164836) internal successors, (135), 92 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:56:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:34,544 INFO L93 Difference]: Finished difference Result 209 states and 328 transitions. [2023-12-19 15:56:34,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:56:34,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-19 15:56:34,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:34,551 INFO L225 Difference]: With dead ends: 209 [2023-12-19 15:56:34,551 INFO L226 Difference]: Without dead ends: 104 [2023-12-19 15:56:34,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:56:34,556 INFO L413 NwaCegarLoop]: 148 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, 148 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 [2023-12-19 15:56:34,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 148 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:56:34,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-19 15:56:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-12-19 15:56:34,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2023-12-19 15:56:34,591 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 110 [2023-12-19 15:56:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:34,591 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2023-12-19 15:56:34,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:56:34,592 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2023-12-19 15:56:34,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:56:34,594 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:34,595 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:34,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:56:34,595 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:34,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:34,596 INFO L85 PathProgramCache]: Analyzing trace with hash 111661611, now seen corresponding path program 1 times [2023-12-19 15:56:34,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:34,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45109647] [2023-12-19 15:56:34,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:34,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:34,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:34,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:34,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:34,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:34,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:34,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45109647] [2023-12-19 15:56:34,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45109647] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:34,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:34,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:56:34,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454414004] [2023-12-19 15:56:34,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:34,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:56:34,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:34,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:56:34,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:56:34,846 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:34,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:34,890 INFO L93 Difference]: Finished difference Result 208 states and 305 transitions. [2023-12-19 15:56:34,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:56:34,893 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-19 15:56:34,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:34,894 INFO L225 Difference]: With dead ends: 208 [2023-12-19 15:56:34,894 INFO L226 Difference]: Without dead ends: 105 [2023-12-19 15:56:34,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:56:34,895 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:34,896 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 289 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:56:34,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-19 15:56:34,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-19 15:56:34,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 91 states have internal predecessors, (129), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:34,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2023-12-19 15:56:34,903 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 110 [2023-12-19 15:56:34,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:34,904 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2023-12-19 15:56:34,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:34,904 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2023-12-19 15:56:34,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:56:34,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:34,906 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:34,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:56:34,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:34,907 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:34,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1882483095, now seen corresponding path program 1 times [2023-12-19 15:56:34,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:34,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990582044] [2023-12-19 15:56:34,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:34,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:34,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:34,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:34,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:35,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:35,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:35,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:35,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:35,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:35,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990582044] [2023-12-19 15:56:35,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990582044] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:35,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:35,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 15:56:35,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562947763] [2023-12-19 15:56:35,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:35,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 15:56:35,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:35,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 15:56:35,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:56:35,030 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:35,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:35,066 INFO L93 Difference]: Finished difference Result 233 states and 340 transitions. [2023-12-19 15:56:35,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 15:56:35,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-19 15:56:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:35,073 INFO L225 Difference]: With dead ends: 233 [2023-12-19 15:56:35,073 INFO L226 Difference]: Without dead ends: 129 [2023-12-19 15:56:35,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 15:56:35,074 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 39 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:35,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 316 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:56:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-12-19 15:56:35,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 106. [2023-12-19 15:56:35,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:35,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2023-12-19 15:56:35,082 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 110 [2023-12-19 15:56:35,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:35,083 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2023-12-19 15:56:35,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:35,083 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2023-12-19 15:56:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-19 15:56:35,090 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:35,091 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:35,091 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:56:35,091 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:35,091 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:35,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1181418517, now seen corresponding path program 1 times [2023-12-19 15:56:35,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:35,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156420270] [2023-12-19 15:56:35,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:35,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:35,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:35,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:35,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:35,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:35,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:35,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:35,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:35,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:35,927 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:35,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:35,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156420270] [2023-12-19 15:56:35,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156420270] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:35,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:35,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:56:35,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177640711] [2023-12-19 15:56:35,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:35,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:56:35,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:35,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:56:35,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:56:35,936 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:56:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:36,318 INFO L93 Difference]: Finished difference Result 276 states and 399 transitions. [2023-12-19 15:56:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:56:36,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-19 15:56:36,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:36,321 INFO L225 Difference]: With dead ends: 276 [2023-12-19 15:56:36,321 INFO L226 Difference]: Without dead ends: 171 [2023-12-19 15:56:36,322 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:56:36,328 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 257 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:36,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 497 Invalid, 397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:56:36,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-12-19 15:56:36,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 117. [2023-12-19 15:56:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 103 states have (on average 1.4174757281553398) internal successors, (146), 103 states have internal predecessors, (146), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:36,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 170 transitions. [2023-12-19 15:56:36,345 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 170 transitions. Word has length 110 [2023-12-19 15:56:36,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:36,345 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 170 transitions. [2023-12-19 15:56:36,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 8 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:56:36,346 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 170 transitions. [2023-12-19 15:56:36,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-19 15:56:36,347 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:36,347 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:36,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:56:36,347 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:36,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:36,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1889022113, now seen corresponding path program 1 times [2023-12-19 15:56:36,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:36,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992684628] [2023-12-19 15:56:36,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:36,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:36,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:36,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:36,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:36,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:36,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:36,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:36,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:36,594 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:36,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:36,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992684628] [2023-12-19 15:56:36,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992684628] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:36,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:56:36,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364237368] [2023-12-19 15:56:36,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:36,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:56:36,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:36,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:56:36,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:56:36,597 INFO L87 Difference]: Start difference. First operand 117 states and 170 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:36,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:36,705 INFO L93 Difference]: Finished difference Result 244 states and 357 transitions. [2023-12-19 15:56:36,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:56:36,706 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2023-12-19 15:56:36,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:36,707 INFO L225 Difference]: With dead ends: 244 [2023-12-19 15:56:36,707 INFO L226 Difference]: Without dead ends: 128 [2023-12-19 15:56:36,708 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:56:36,708 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 12 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:36,709 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 490 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:56:36,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2023-12-19 15:56:36,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2023-12-19 15:56:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 105 states have (on average 1.4095238095238096) internal successors, (148), 105 states have internal predecessors, (148), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 172 transitions. [2023-12-19 15:56:36,732 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 172 transitions. Word has length 111 [2023-12-19 15:56:36,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:36,733 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 172 transitions. [2023-12-19 15:56:36,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:36,733 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 172 transitions. [2023-12-19 15:56:36,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-19 15:56:36,736 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:36,736 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:36,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:56:36,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:36,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash 717001441, now seen corresponding path program 1 times [2023-12-19 15:56:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:36,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009592880] [2023-12-19 15:56:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:36,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:36,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:37,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:37,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:37,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:37,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:37,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:37,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:37,359 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:37,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:37,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009592880] [2023-12-19 15:56:37,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009592880] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:37,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:37,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:56:37,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607389535] [2023-12-19 15:56:37,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:37,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:56:37,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:37,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:56:37,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:56:37,361 INFO L87 Difference]: Start difference. First operand 119 states and 172 transitions. Second operand has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:37,627 INFO L93 Difference]: Finished difference Result 313 states and 453 transitions. [2023-12-19 15:56:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:56:37,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2023-12-19 15:56:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:37,629 INFO L225 Difference]: With dead ends: 313 [2023-12-19 15:56:37,629 INFO L226 Difference]: Without dead ends: 195 [2023-12-19 15:56:37,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:56:37,630 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 303 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:37,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 584 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:56:37,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-19 15:56:37,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 129. [2023-12-19 15:56:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 115 states have (on average 1.4260869565217391) internal successors, (164), 115 states have internal predecessors, (164), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:37,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 188 transitions. [2023-12-19 15:56:37,644 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 188 transitions. Word has length 111 [2023-12-19 15:56:37,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:37,644 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 188 transitions. [2023-12-19 15:56:37,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.0) internal successors, (54), 9 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:37,645 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 188 transitions. [2023-12-19 15:56:37,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 15:56:37,647 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:37,647 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:37,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:56:37,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:37,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:37,647 INFO L85 PathProgramCache]: Analyzing trace with hash -360231913, now seen corresponding path program 1 times [2023-12-19 15:56:37,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:37,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950961199] [2023-12-19 15:56:37,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:37,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:38,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:38,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:38,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,171 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:38,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:38,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950961199] [2023-12-19 15:56:38,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950961199] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:38,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:38,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:56:38,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780722559] [2023-12-19 15:56:38,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:38,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:56:38,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:38,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:56:38,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:56:38,173 INFO L87 Difference]: Start difference. First operand 129 states and 188 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:38,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:38,425 INFO L93 Difference]: Finished difference Result 356 states and 517 transitions. [2023-12-19 15:56:38,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:56:38,425 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-19 15:56:38,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:38,426 INFO L225 Difference]: With dead ends: 356 [2023-12-19 15:56:38,426 INFO L226 Difference]: Without dead ends: 228 [2023-12-19 15:56:38,427 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:56:38,428 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 248 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:38,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 508 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:56:38,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-12-19 15:56:38,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 148. [2023-12-19 15:56:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 134 states have (on average 1.4328358208955223) internal successors, (192), 134 states have internal predecessors, (192), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:38,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2023-12-19 15:56:38,438 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 112 [2023-12-19 15:56:38,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:38,439 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2023-12-19 15:56:38,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2023-12-19 15:56:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 15:56:38,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:38,440 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:38,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:56:38,440 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:38,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash -947037927, now seen corresponding path program 1 times [2023-12-19 15:56:38,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:38,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538936064] [2023-12-19 15:56:38,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:38,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:38,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:38,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:38,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:38,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:38,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:38,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:38,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:38,887 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:38,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:38,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538936064] [2023-12-19 15:56:38,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538936064] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:38,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:38,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:56:38,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877511834] [2023-12-19 15:56:38,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:38,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:56:38,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:38,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:56:38,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:56:38,889 INFO L87 Difference]: Start difference. First operand 148 states and 216 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:39,116 INFO L93 Difference]: Finished difference Result 383 states and 555 transitions. [2023-12-19 15:56:39,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:56:39,116 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-19 15:56:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:39,117 INFO L225 Difference]: With dead ends: 383 [2023-12-19 15:56:39,117 INFO L226 Difference]: Without dead ends: 236 [2023-12-19 15:56:39,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:56:39,118 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 399 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:39,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 478 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:56:39,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-19 15:56:39,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 157. [2023-12-19 15:56:39,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 143 states have (on average 1.4335664335664335) internal successors, (205), 143 states have internal predecessors, (205), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 229 transitions. [2023-12-19 15:56:39,128 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 229 transitions. Word has length 112 [2023-12-19 15:56:39,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:39,129 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 229 transitions. [2023-12-19 15:56:39,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:39,129 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 229 transitions. [2023-12-19 15:56:39,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 15:56:39,130 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:39,130 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:39,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 15:56:39,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:39,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:39,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1926559089, now seen corresponding path program 1 times [2023-12-19 15:56:39,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:39,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974532535] [2023-12-19 15:56:39,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:39,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:39,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:39,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:39,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:39,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:39,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:39,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974532535] [2023-12-19 15:56:39,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974532535] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:39,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:39,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:56:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307872321] [2023-12-19 15:56:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:39,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:56:39,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:39,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:56:39,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:56:39,467 INFO L87 Difference]: Start difference. First operand 157 states and 229 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:39,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:39,740 INFO L93 Difference]: Finished difference Result 395 states and 573 transitions. [2023-12-19 15:56:39,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 15:56:39,741 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-19 15:56:39,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:39,742 INFO L225 Difference]: With dead ends: 395 [2023-12-19 15:56:39,742 INFO L226 Difference]: Without dead ends: 239 [2023-12-19 15:56:39,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:56:39,742 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 238 mSDsluCounter, 710 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:39,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 864 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:56:39,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-12-19 15:56:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 185. [2023-12-19 15:56:39,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 171 states have (on average 1.4385964912280702) internal successors, (246), 171 states have internal predecessors, (246), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:39,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 270 transitions. [2023-12-19 15:56:39,751 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 270 transitions. Word has length 113 [2023-12-19 15:56:39,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:39,751 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 270 transitions. [2023-12-19 15:56:39,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:39,751 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 270 transitions. [2023-12-19 15:56:39,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 15:56:39,752 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:39,752 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:39,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 15:56:39,752 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:39,753 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:39,753 INFO L85 PathProgramCache]: Analyzing trace with hash 585017882, now seen corresponding path program 1 times [2023-12-19 15:56:39,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:39,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305560343] [2023-12-19 15:56:39,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:39,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:40,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:40,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:40,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:40,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:40,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:40,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:40,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305560343] [2023-12-19 15:56:40,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305560343] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:40,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:40,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:56:40,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529637628] [2023-12-19 15:56:40,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:40,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:56:40,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:40,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:56:40,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:56:40,612 INFO L87 Difference]: Start difference. First operand 185 states and 270 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:40,977 INFO L93 Difference]: Finished difference Result 523 states and 760 transitions. [2023-12-19 15:56:40,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:56:40,978 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-19 15:56:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:40,979 INFO L225 Difference]: With dead ends: 523 [2023-12-19 15:56:40,979 INFO L226 Difference]: Without dead ends: 310 [2023-12-19 15:56:40,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:56:40,980 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 236 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:40,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 643 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:56:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-12-19 15:56:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 211. [2023-12-19 15:56:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 197 states have (on average 1.4365482233502538) internal successors, (283), 197 states have internal predecessors, (283), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 307 transitions. [2023-12-19 15:56:40,991 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 307 transitions. Word has length 113 [2023-12-19 15:56:40,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:40,992 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 307 transitions. [2023-12-19 15:56:40,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 9 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 307 transitions. [2023-12-19 15:56:40,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 15:56:40,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:40,993 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:40,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 15:56:40,993 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:40,993 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:40,993 INFO L85 PathProgramCache]: Analyzing trace with hash -648266811, now seen corresponding path program 1 times [2023-12-19 15:56:40,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:40,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091658534] [2023-12-19 15:56:40,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:40,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:41,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:41,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:41,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:41,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:41,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:41,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:41,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:41,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:41,451 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:41,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:41,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091658534] [2023-12-19 15:56:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091658534] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:41,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:41,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:56:41,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204835368] [2023-12-19 15:56:41,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:41,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:56:41,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:41,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:56:41,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:56:41,453 INFO L87 Difference]: Start difference. First operand 211 states and 307 transitions. Second operand has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:41,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:41,728 INFO L93 Difference]: Finished difference Result 403 states and 584 transitions. [2023-12-19 15:56:41,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:56:41,729 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-19 15:56:41,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:41,729 INFO L225 Difference]: With dead ends: 403 [2023-12-19 15:56:41,730 INFO L226 Difference]: Without dead ends: 193 [2023-12-19 15:56:41,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:56:41,730 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 130 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 383 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:41,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 561 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 383 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:56:41,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-19 15:56:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 181. [2023-12-19 15:56:41,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 167 states have (on average 1.407185628742515) internal successors, (235), 167 states have internal predecessors, (235), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:41,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 259 transitions. [2023-12-19 15:56:41,740 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 259 transitions. Word has length 113 [2023-12-19 15:56:41,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:41,740 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 259 transitions. [2023-12-19 15:56:41,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.0) internal successors, (56), 8 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 259 transitions. [2023-12-19 15:56:41,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:56:41,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:41,742 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:41,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 15:56:41,742 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:41,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:41,742 INFO L85 PathProgramCache]: Analyzing trace with hash -974403396, now seen corresponding path program 1 times [2023-12-19 15:56:41,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:41,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572570081] [2023-12-19 15:56:41,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:41,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,162 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:42,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:42,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572570081] [2023-12-19 15:56:42,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572570081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:42,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:42,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:56:42,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574607711] [2023-12-19 15:56:42,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:42,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:56:42,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:42,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:56:42,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:56:42,165 INFO L87 Difference]: Start difference. First operand 181 states and 259 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:42,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:42,387 INFO L93 Difference]: Finished difference Result 367 states and 525 transitions. [2023-12-19 15:56:42,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:56:42,388 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:56:42,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:42,389 INFO L225 Difference]: With dead ends: 367 [2023-12-19 15:56:42,389 INFO L226 Difference]: Without dead ends: 187 [2023-12-19 15:56:42,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:56:42,390 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 140 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:42,390 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 494 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:56:42,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-19 15:56:42,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 180. [2023-12-19 15:56:42,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 166 states have (on average 1.3975903614457832) internal successors, (232), 166 states have internal predecessors, (232), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:42,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 256 transitions. [2023-12-19 15:56:42,399 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 256 transitions. Word has length 114 [2023-12-19 15:56:42,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:42,400 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 256 transitions. [2023-12-19 15:56:42,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:42,400 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 256 transitions. [2023-12-19 15:56:42,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:56:42,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:42,401 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:42,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 15:56:42,401 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:42,401 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:42,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1162236377, now seen corresponding path program 1 times [2023-12-19 15:56:42,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:42,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242169877] [2023-12-19 15:56:42,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:42,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:42,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:42,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:42,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:42,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:42,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:42,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:42,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:42,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:42,592 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:42,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:42,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242169877] [2023-12-19 15:56:42,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242169877] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:42,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:42,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:56:42,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461748087] [2023-12-19 15:56:42,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:42,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:56:42,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:42,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:56:42,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:56:42,594 INFO L87 Difference]: Start difference. First operand 180 states and 256 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:42,727 INFO L93 Difference]: Finished difference Result 426 states and 605 transitions. [2023-12-19 15:56:42,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:56:42,727 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:56:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:42,728 INFO L225 Difference]: With dead ends: 426 [2023-12-19 15:56:42,729 INFO L226 Difference]: Without dead ends: 247 [2023-12-19 15:56:42,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:56:42,729 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 153 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:42,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 447 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:56:42,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-12-19 15:56:42,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 193. [2023-12-19 15:56:42,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 179 states have (on average 1.3910614525139664) internal successors, (249), 179 states have internal predecessors, (249), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 15:56:42,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 273 transitions. [2023-12-19 15:56:42,741 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 273 transitions. Word has length 114 [2023-12-19 15:56:42,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:42,742 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 273 transitions. [2023-12-19 15:56:42,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:42,742 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 273 transitions. [2023-12-19 15:56:42,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:56:42,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:42,743 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:42,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 15:56:42,743 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:42,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1010771952, now seen corresponding path program 1 times [2023-12-19 15:56:42,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:42,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353840788] [2023-12-19 15:56:42,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:42,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:43,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:43,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:43,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:43,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:43,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:43,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:43,541 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353840788] [2023-12-19 15:56:43,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353840788] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:43,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:43,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:56:43,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762861849] [2023-12-19 15:56:43,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:43,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:56:43,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:43,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:56:43,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:56:43,543 INFO L87 Difference]: Start difference. First operand 193 states and 273 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:44,114 INFO L93 Difference]: Finished difference Result 664 states and 937 transitions. [2023-12-19 15:56:44,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:56:44,114 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:56:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:44,116 INFO L225 Difference]: With dead ends: 664 [2023-12-19 15:56:44,116 INFO L226 Difference]: Without dead ends: 472 [2023-12-19 15:56:44,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:56:44,117 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 318 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:44,117 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 520 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:56:44,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2023-12-19 15:56:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 291. [2023-12-19 15:56:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 264 states have (on average 1.3825757575757576) internal successors, (365), 264 states have internal predecessors, (365), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:56:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 413 transitions. [2023-12-19 15:56:44,141 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 413 transitions. Word has length 114 [2023-12-19 15:56:44,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:44,141 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 413 transitions. [2023-12-19 15:56:44,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:44,141 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 413 transitions. [2023-12-19 15:56:44,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:56:44,142 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:44,142 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:44,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-19 15:56:44,142 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:44,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:44,143 INFO L85 PathProgramCache]: Analyzing trace with hash -617744942, now seen corresponding path program 1 times [2023-12-19 15:56:44,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:44,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467091558] [2023-12-19 15:56:44,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:44,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:44,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:44,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:44,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:44,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:44,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:44,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:44,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:44,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:44,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:44,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:44,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:44,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467091558] [2023-12-19 15:56:44,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467091558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:44,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:44,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 15:56:44,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644014398] [2023-12-19 15:56:44,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:44,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 15:56:44,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:44,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 15:56:44,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:56:44,913 INFO L87 Difference]: Start difference. First operand 291 states and 413 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:45,657 INFO L93 Difference]: Finished difference Result 670 states and 945 transitions. [2023-12-19 15:56:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-19 15:56:45,658 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:56:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:45,660 INFO L225 Difference]: With dead ends: 670 [2023-12-19 15:56:45,660 INFO L226 Difference]: Without dead ends: 478 [2023-12-19 15:56:45,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=524, Unknown=0, NotChecked=0, Total=650 [2023-12-19 15:56:45,662 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 465 mSDsluCounter, 872 mSDsCounter, 0 mSdLazyCounter, 876 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 876 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:45,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 971 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 876 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-19 15:56:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-12-19 15:56:45,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 295. [2023-12-19 15:56:45,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 268 states have (on average 1.376865671641791) internal successors, (369), 268 states have internal predecessors, (369), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:56:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 417 transitions. [2023-12-19 15:56:45,685 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 417 transitions. Word has length 114 [2023-12-19 15:56:45,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:45,685 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 417 transitions. [2023-12-19 15:56:45,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:45,685 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 417 transitions. [2023-12-19 15:56:45,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:56:45,686 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:45,686 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:45,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-19 15:56:45,687 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:45,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:45,687 INFO L85 PathProgramCache]: Analyzing trace with hash -34649853, now seen corresponding path program 1 times [2023-12-19 15:56:45,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:45,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593409973] [2023-12-19 15:56:45,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:45,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:46,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:46,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:46,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:46,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:46,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:46,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:46,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:46,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:46,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593409973] [2023-12-19 15:56:46,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593409973] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:46,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:46,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:56:46,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933771271] [2023-12-19 15:56:46,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:46,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:56:46,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:46,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:56:46,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:56:46,581 INFO L87 Difference]: Start difference. First operand 295 states and 417 transitions. Second operand has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:47,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:47,548 INFO L93 Difference]: Finished difference Result 697 states and 975 transitions. [2023-12-19 15:56:47,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 15:56:47,560 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:56:47,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:47,562 INFO L225 Difference]: With dead ends: 697 [2023-12-19 15:56:47,562 INFO L226 Difference]: Without dead ends: 496 [2023-12-19 15:56:47,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=111, Invalid=351, Unknown=0, NotChecked=0, Total=462 [2023-12-19 15:56:47,563 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 351 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 911 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 351 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 911 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:47,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [351 Valid, 982 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 911 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 15:56:47,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2023-12-19 15:56:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 295. [2023-12-19 15:56:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 268 states have (on average 1.373134328358209) internal successors, (368), 268 states have internal predecessors, (368), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:56:47,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 416 transitions. [2023-12-19 15:56:47,589 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 416 transitions. Word has length 114 [2023-12-19 15:56:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:47,590 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 416 transitions. [2023-12-19 15:56:47,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.181818181818182) internal successors, (57), 11 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 416 transitions. [2023-12-19 15:56:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:56:47,592 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:47,592 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:47,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-19 15:56:47,592 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:47,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash -551523215, now seen corresponding path program 1 times [2023-12-19 15:56:47,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:47,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855990284] [2023-12-19 15:56:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:47,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:48,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:48,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:48,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:48,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:48,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:48,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:48,179 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:48,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:48,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855990284] [2023-12-19 15:56:48,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855990284] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:48,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:48,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:56:48,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660702008] [2023-12-19 15:56:48,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:48,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:56:48,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:48,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:56:48,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:56:48,181 INFO L87 Difference]: Start difference. First operand 295 states and 416 transitions. Second operand has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:48,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:48,499 INFO L93 Difference]: Finished difference Result 539 states and 756 transitions. [2023-12-19 15:56:48,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:56:48,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:56:48,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:48,501 INFO L225 Difference]: With dead ends: 539 [2023-12-19 15:56:48,501 INFO L226 Difference]: Without dead ends: 347 [2023-12-19 15:56:48,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:56:48,502 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 395 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:48,502 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 438 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:56:48,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-12-19 15:56:48,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 266. [2023-12-19 15:56:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 239 states have (on average 1.3556485355648535) internal successors, (324), 239 states have internal predecessors, (324), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:56:48,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 372 transitions. [2023-12-19 15:56:48,518 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 372 transitions. Word has length 114 [2023-12-19 15:56:48,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:48,518 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 372 transitions. [2023-12-19 15:56:48,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.333333333333333) internal successors, (57), 9 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:48,518 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 372 transitions. [2023-12-19 15:56:48,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:56:48,519 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:48,519 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:48,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-19 15:56:48,519 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:48,519 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:48,519 INFO L85 PathProgramCache]: Analyzing trace with hash 912456082, now seen corresponding path program 1 times [2023-12-19 15:56:48,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:48,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804120283] [2023-12-19 15:56:48,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:48,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:49,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:49,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:49,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:49,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:49,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:49,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:49,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:49,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:49,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:49,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:49,236 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:49,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:49,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804120283] [2023-12-19 15:56:49,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804120283] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:49,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:49,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-19 15:56:49,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025965514] [2023-12-19 15:56:49,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:49,237 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-19 15:56:49,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:49,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-19 15:56:49,237 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2023-12-19 15:56:49,238 INFO L87 Difference]: Start difference. First operand 266 states and 372 transitions. Second operand has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:50,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:50,018 INFO L93 Difference]: Finished difference Result 532 states and 743 transitions. [2023-12-19 15:56:50,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-19 15:56:50,019 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:56:50,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:50,021 INFO L225 Difference]: With dead ends: 532 [2023-12-19 15:56:50,021 INFO L226 Difference]: Without dead ends: 369 [2023-12-19 15:56:50,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=514, Unknown=0, NotChecked=0, Total=650 [2023-12-19 15:56:50,022 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 310 mSDsluCounter, 1095 mSDsCounter, 0 mSdLazyCounter, 912 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 920 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 912 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:50,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 1241 Invalid, 920 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 912 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:56:50,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-12-19 15:56:50,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 313. [2023-12-19 15:56:50,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 286 states have (on average 1.3601398601398602) internal successors, (389), 286 states have internal predecessors, (389), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:56:50,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 437 transitions. [2023-12-19 15:56:50,044 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 437 transitions. Word has length 114 [2023-12-19 15:56:50,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:50,045 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 437 transitions. [2023-12-19 15:56:50,046 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.384615384615385) internal successors, (57), 13 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:50,046 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 437 transitions. [2023-12-19 15:56:50,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:56:50,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:50,047 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:50,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-19 15:56:50,047 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:50,047 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:50,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1305483092, now seen corresponding path program 1 times [2023-12-19 15:56:50,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:50,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826088734] [2023-12-19 15:56:50,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:50,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:50,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:50,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:50,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:50,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:50,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:50,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:50,472 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:50,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:50,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826088734] [2023-12-19 15:56:50,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826088734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:50,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:50,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:56:50,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403120129] [2023-12-19 15:56:50,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:50,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:56:50,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:50,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:56:50,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:56:50,474 INFO L87 Difference]: Start difference. First operand 313 states and 437 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:50,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:50,834 INFO L93 Difference]: Finished difference Result 583 states and 811 transitions. [2023-12-19 15:56:50,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:56:50,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:56:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:50,836 INFO L225 Difference]: With dead ends: 583 [2023-12-19 15:56:50,836 INFO L226 Difference]: Without dead ends: 369 [2023-12-19 15:56:50,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:56:50,837 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 208 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:50,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 573 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:56:50,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2023-12-19 15:56:50,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 313. [2023-12-19 15:56:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 286 states have (on average 1.3566433566433567) internal successors, (388), 286 states have internal predecessors, (388), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:56:50,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 436 transitions. [2023-12-19 15:56:50,853 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 436 transitions. Word has length 114 [2023-12-19 15:56:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:50,853 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 436 transitions. [2023-12-19 15:56:50,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 436 transitions. [2023-12-19 15:56:50,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 15:56:50,854 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:50,854 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:50,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-19 15:56:50,854 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:50,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:50,854 INFO L85 PathProgramCache]: Analyzing trace with hash 1888578181, now seen corresponding path program 1 times [2023-12-19 15:56:50,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:50,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565846212] [2023-12-19 15:56:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:50,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:51,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:51,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:51,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:51,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:51,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:51,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:51,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:51,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:51,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:51,807 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:51,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:51,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565846212] [2023-12-19 15:56:51,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565846212] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:51,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:51,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 15:56:51,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006704624] [2023-12-19 15:56:51,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:51,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 15:56:51,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:51,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 15:56:51,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:56:51,809 INFO L87 Difference]: Start difference. First operand 313 states and 436 transitions. Second operand has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:53,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:53,030 INFO L93 Difference]: Finished difference Result 832 states and 1140 transitions. [2023-12-19 15:56:53,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:56:53,030 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2023-12-19 15:56:53,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:53,033 INFO L225 Difference]: With dead ends: 832 [2023-12-19 15:56:53,033 INFO L226 Difference]: Without dead ends: 618 [2023-12-19 15:56:53,033 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2023-12-19 15:56:53,034 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 441 mSDsluCounter, 932 mSDsCounter, 0 mSdLazyCounter, 1102 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 1163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 1102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:53,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 1058 Invalid, 1163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 1102 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-19 15:56:53,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2023-12-19 15:56:53,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 331. [2023-12-19 15:56:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 304 states have (on average 1.3585526315789473) internal successors, (413), 304 states have internal predecessors, (413), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:56:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 461 transitions. [2023-12-19 15:56:53,058 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 461 transitions. Word has length 114 [2023-12-19 15:56:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:53,058 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 461 transitions. [2023-12-19 15:56:53,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.75) internal successors, (57), 12 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 461 transitions. [2023-12-19 15:56:53,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 15:56:53,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:53,059 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:53,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-19 15:56:53,060 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:53,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:53,060 INFO L85 PathProgramCache]: Analyzing trace with hash -865948523, now seen corresponding path program 1 times [2023-12-19 15:56:53,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:53,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251679329] [2023-12-19 15:56:53,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:53,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:53,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:53,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:53,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:53,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:53,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:53,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:53,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:53,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:53,807 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:53,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:53,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251679329] [2023-12-19 15:56:53,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251679329] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:53,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:53,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:56:53,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432351501] [2023-12-19 15:56:53,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:53,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:56:53,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:53,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:56:53,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:56:53,809 INFO L87 Difference]: Start difference. First operand 331 states and 461 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:54,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:54,891 INFO L93 Difference]: Finished difference Result 832 states and 1134 transitions. [2023-12-19 15:56:54,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 15:56:54,892 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-19 15:56:54,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:54,894 INFO L225 Difference]: With dead ends: 832 [2023-12-19 15:56:54,894 INFO L226 Difference]: Without dead ends: 611 [2023-12-19 15:56:54,895 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2023-12-19 15:56:54,895 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 388 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1129 SdHoareTripleChecker+Invalid, 1051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:54,895 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1129 Invalid, 1051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-19 15:56:54,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2023-12-19 15:56:54,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 331. [2023-12-19 15:56:54,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 304 states have (on average 1.355263157894737) internal successors, (412), 304 states have internal predecessors, (412), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:56:54,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 460 transitions. [2023-12-19 15:56:54,915 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 460 transitions. Word has length 115 [2023-12-19 15:56:54,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:54,915 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 460 transitions. [2023-12-19 15:56:54,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 11 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:54,915 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 460 transitions. [2023-12-19 15:56:54,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-12-19 15:56:54,916 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:54,916 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:54,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-19 15:56:54,917 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:54,917 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:54,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1375421613, now seen corresponding path program 1 times [2023-12-19 15:56:54,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:54,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140012729] [2023-12-19 15:56:54,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:54,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:55,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:55,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:55,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:55,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:55,774 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:55,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:55,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140012729] [2023-12-19 15:56:55,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140012729] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:55,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:55,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 15:56:55,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630271477] [2023-12-19 15:56:55,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:55,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 15:56:55,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:55,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 15:56:55,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:56:55,776 INFO L87 Difference]: Start difference. First operand 331 states and 460 transitions. Second operand has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:56,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:56:56,830 INFO L93 Difference]: Finished difference Result 809 states and 1104 transitions. [2023-12-19 15:56:56,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 15:56:56,832 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2023-12-19 15:56:56,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:56:56,834 INFO L225 Difference]: With dead ends: 809 [2023-12-19 15:56:56,834 INFO L226 Difference]: Without dead ends: 595 [2023-12-19 15:56:56,835 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2023-12-19 15:56:56,835 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 414 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1047 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 1106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 1047 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-19 15:56:56,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 1087 Invalid, 1106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 1047 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-19 15:56:56,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2023-12-19 15:56:56,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 341. [2023-12-19 15:56:56,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 314 states have (on average 1.3535031847133758) internal successors, (425), 314 states have internal predecessors, (425), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:56:56,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 473 transitions. [2023-12-19 15:56:56,858 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 473 transitions. Word has length 115 [2023-12-19 15:56:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:56:56,858 INFO L495 AbstractCegarLoop]: Abstraction has 341 states and 473 transitions. [2023-12-19 15:56:56,858 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.833333333333333) internal successors, (58), 12 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:56:56,859 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 473 transitions. [2023-12-19 15:56:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:56:56,859 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:56:56,859 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:56:56,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-19 15:56:56,860 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:56:56,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:56:56,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1897854349, now seen corresponding path program 1 times [2023-12-19 15:56:56,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:56:56,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695625148] [2023-12-19 15:56:56,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:56:56,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:56:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:56:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:56:59,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:56:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:56:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:56:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:56:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:56:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:56:59,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:56:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:56:59,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:56:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:56:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:56:59,404 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:56:59,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:56:59,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695625148] [2023-12-19 15:56:59,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695625148] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:56:59,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:56:59,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-12-19 15:56:59,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949945332] [2023-12-19 15:56:59,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:56:59,405 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-19 15:56:59,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:56:59,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-19 15:56:59,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:56:59,406 INFO L87 Difference]: Start difference. First operand 341 states and 473 transitions. Second operand has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-19 15:57:06,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:06,309 INFO L93 Difference]: Finished difference Result 723 states and 998 transitions. [2023-12-19 15:57:06,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:57:06,310 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 116 [2023-12-19 15:57:06,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:06,329 INFO L225 Difference]: With dead ends: 723 [2023-12-19 15:57:06,329 INFO L226 Difference]: Without dead ends: 509 [2023-12-19 15:57:06,330 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=105, Invalid=447, Unknown=0, NotChecked=0, Total=552 [2023-12-19 15:57:06,330 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 420 mSDsluCounter, 1008 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 1164 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:06,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 1164 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-12-19 15:57:06,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-12-19 15:57:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 377. [2023-12-19 15:57:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 349 states have (on average 1.3495702005730659) internal successors, (471), 349 states have internal predecessors, (471), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:57:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 519 transitions. [2023-12-19 15:57:06,350 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 519 transitions. Word has length 116 [2023-12-19 15:57:06,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:06,351 INFO L495 AbstractCegarLoop]: Abstraction has 377 states and 519 transitions. [2023-12-19 15:57:06,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.933333333333333) internal successors, (59), 16 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-19 15:57:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 519 transitions. [2023-12-19 15:57:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:57:06,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:06,352 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:06,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-12-19 15:57:06,352 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:06,352 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:06,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1757305739, now seen corresponding path program 1 times [2023-12-19 15:57:06,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:06,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894945206] [2023-12-19 15:57:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:06,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:06,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:08,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:08,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:08,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:08,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:08,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:08,065 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:08,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:08,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894945206] [2023-12-19 15:57:08,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894945206] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:08,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:08,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-19 15:57:08,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732064683] [2023-12-19 15:57:08,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:08,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 15:57:08,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:08,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 15:57:08,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:57:08,067 INFO L87 Difference]: Start difference. First operand 377 states and 519 transitions. Second operand has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:57:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:09,880 INFO L93 Difference]: Finished difference Result 763 states and 1047 transitions. [2023-12-19 15:57:09,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-19 15:57:09,886 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2023-12-19 15:57:09,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:09,889 INFO L225 Difference]: With dead ends: 763 [2023-12-19 15:57:09,889 INFO L226 Difference]: Without dead ends: 513 [2023-12-19 15:57:09,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2023-12-19 15:57:09,891 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 404 mSDsluCounter, 1018 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1179 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:09,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1179 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-12-19 15:57:09,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2023-12-19 15:57:09,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 360. [2023-12-19 15:57:09,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 332 states have (on average 1.3493975903614457) internal successors, (448), 332 states have internal predecessors, (448), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:57:09,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 496 transitions. [2023-12-19 15:57:09,914 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 496 transitions. Word has length 116 [2023-12-19 15:57:09,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:09,914 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 496 transitions. [2023-12-19 15:57:09,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.933333333333333) internal successors, (59), 15 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:57:09,915 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 496 transitions. [2023-12-19 15:57:09,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:57:09,915 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:09,915 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:09,916 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-12-19 15:57:09,916 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:09,916 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:09,916 INFO L85 PathProgramCache]: Analyzing trace with hash -724104864, now seen corresponding path program 1 times [2023-12-19 15:57:09,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:09,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031352680] [2023-12-19 15:57:09,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:09,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:10,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:10,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:10,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,016 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:10,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:10,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031352680] [2023-12-19 15:57:10,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031352680] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:10,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:10,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:57:10,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456363176] [2023-12-19 15:57:10,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:10,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:57:10,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:10,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:57:10,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:57:10,017 INFO L87 Difference]: Start difference. First operand 360 states and 496 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:57:10,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:10,066 INFO L93 Difference]: Finished difference Result 603 states and 829 transitions. [2023-12-19 15:57:10,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:57:10,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-19 15:57:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:10,072 INFO L225 Difference]: With dead ends: 603 [2023-12-19 15:57:10,072 INFO L226 Difference]: Without dead ends: 370 [2023-12-19 15:57:10,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:57:10,073 INFO L413 NwaCegarLoop]: 145 mSDtfsCounter, 45 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:10,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 560 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:57:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2023-12-19 15:57:10,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 363. [2023-12-19 15:57:10,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 335 states have (on average 1.346268656716418) internal successors, (451), 335 states have internal predecessors, (451), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:57:10,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 499 transitions. [2023-12-19 15:57:10,098 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 499 transitions. Word has length 116 [2023-12-19 15:57:10,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:10,098 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 499 transitions. [2023-12-19 15:57:10,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:57:10,098 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 499 transitions. [2023-12-19 15:57:10,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:57:10,099 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:10,099 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:10,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-12-19 15:57:10,099 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:10,100 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:10,100 INFO L85 PathProgramCache]: Analyzing trace with hash 263277342, now seen corresponding path program 1 times [2023-12-19 15:57:10,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:10,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898614711] [2023-12-19 15:57:10,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:10,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:10,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:10,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:10,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:10,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:10,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:10,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:10,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:10,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:10,502 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:10,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:10,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898614711] [2023-12-19 15:57:10,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898614711] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:10,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:10,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:57:10,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369734479] [2023-12-19 15:57:10,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:10,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:57:10,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:10,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:57:10,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:57:10,504 INFO L87 Difference]: Start difference. First operand 363 states and 499 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:57:11,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:11,074 INFO L93 Difference]: Finished difference Result 836 states and 1126 transitions. [2023-12-19 15:57:11,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-12-19 15:57:11,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2023-12-19 15:57:11,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:11,076 INFO L225 Difference]: With dead ends: 836 [2023-12-19 15:57:11,076 INFO L226 Difference]: Without dead ends: 600 [2023-12-19 15:57:11,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=482, Unknown=0, NotChecked=0, Total=650 [2023-12-19 15:57:11,077 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 489 mSDsluCounter, 665 mSDsCounter, 0 mSdLazyCounter, 528 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 802 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 528 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:11,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 802 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 528 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:57:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2023-12-19 15:57:11,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 431. [2023-12-19 15:57:11,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 403 states have (on average 1.347394540942928) internal successors, (543), 403 states have internal predecessors, (543), 24 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-19 15:57:11,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 591 transitions. [2023-12-19 15:57:11,099 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 591 transitions. Word has length 116 [2023-12-19 15:57:11,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:11,100 INFO L495 AbstractCegarLoop]: Abstraction has 431 states and 591 transitions. [2023-12-19 15:57:11,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 11 states have internal predecessors, (59), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:57:11,100 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 591 transitions. [2023-12-19 15:57:11,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:57:11,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:11,101 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:11,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-12-19 15:57:11,101 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:11,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:11,101 INFO L85 PathProgramCache]: Analyzing trace with hash 685979168, now seen corresponding path program 1 times [2023-12-19 15:57:11,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:11,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56653404] [2023-12-19 15:57:11,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:11,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:11,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:11,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:11,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:11,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:11,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:11,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:11,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56653404] [2023-12-19 15:57:11,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56653404] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:11,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:11,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-19 15:57:11,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647039679] [2023-12-19 15:57:11,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:11,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-19 15:57:11,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:11,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-19 15:57:11,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-19 15:57:11,737 INFO L87 Difference]: Start difference. First operand 431 states and 591 transitions. Second operand has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:57:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:12,161 INFO L93 Difference]: Finished difference Result 867 states and 1161 transitions. [2023-12-19 15:57:12,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 15:57:12,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 116 [2023-12-19 15:57:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:12,163 INFO L225 Difference]: With dead ends: 867 [2023-12-19 15:57:12,163 INFO L226 Difference]: Without dead ends: 579 [2023-12-19 15:57:12,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:57:12,164 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 533 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:12,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 614 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:57:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2023-12-19 15:57:12,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 499. [2023-12-19 15:57:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 467 states have (on average 1.3211991434689507) internal successors, (617), 468 states have internal predecessors, (617), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:57:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 669 transitions. [2023-12-19 15:57:12,192 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 669 transitions. Word has length 116 [2023-12-19 15:57:12,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:12,192 INFO L495 AbstractCegarLoop]: Abstraction has 499 states and 669 transitions. [2023-12-19 15:57:12,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.363636363636363) internal successors, (59), 12 states have internal predecessors, (59), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:57:12,192 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 669 transitions. [2023-12-19 15:57:12,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-19 15:57:12,193 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:12,193 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:12,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-12-19 15:57:12,193 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:12,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:12,193 INFO L85 PathProgramCache]: Analyzing trace with hash -580999627, now seen corresponding path program 1 times [2023-12-19 15:57:12,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:12,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895697091] [2023-12-19 15:57:12,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:12,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:12,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:12,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:12,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:12,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:12,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:12,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:12,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:12,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:12,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895697091] [2023-12-19 15:57:12,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895697091] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:12,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:12,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-19 15:57:12,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283532973] [2023-12-19 15:57:12,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:12,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-19 15:57:12,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:12,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-19 15:57:12,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:57:12,387 INFO L87 Difference]: Start difference. First operand 499 states and 669 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:57:12,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:12,547 INFO L93 Difference]: Finished difference Result 816 states and 1092 transitions. [2023-12-19 15:57:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:57:12,547 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2023-12-19 15:57:12,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:12,550 INFO L225 Difference]: With dead ends: 816 [2023-12-19 15:57:12,550 INFO L226 Difference]: Without dead ends: 472 [2023-12-19 15:57:12,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:57:12,551 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 148 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:12,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 417 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:57:12,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2023-12-19 15:57:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2023-12-19 15:57:12,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 440 states have (on average 1.309090909090909) internal successors, (576), 441 states have internal predecessors, (576), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:57:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 628 transitions. [2023-12-19 15:57:12,577 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 628 transitions. Word has length 116 [2023-12-19 15:57:12,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:12,578 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 628 transitions. [2023-12-19 15:57:12,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:57:12,578 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 628 transitions. [2023-12-19 15:57:12,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 15:57:12,578 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:12,579 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:12,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-12-19 15:57:12,579 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:12,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1773000673, now seen corresponding path program 1 times [2023-12-19 15:57:12,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:12,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905706079] [2023-12-19 15:57:12,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:12,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:14,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:14,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:14,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:14,156 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:14,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:14,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905706079] [2023-12-19 15:57:14,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905706079] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:14,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:14,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-12-19 15:57:14,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468200898] [2023-12-19 15:57:14,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:14,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-12-19 15:57:14,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:14,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-12-19 15:57:14,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:57:14,159 INFO L87 Difference]: Start difference. First operand 472 states and 628 transitions. Second operand has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:57:15,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:15,603 INFO L93 Difference]: Finished difference Result 923 states and 1224 transitions. [2023-12-19 15:57:15,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-19 15:57:15,604 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-19 15:57:15,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:15,606 INFO L225 Difference]: With dead ends: 923 [2023-12-19 15:57:15,606 INFO L226 Difference]: Without dead ends: 606 [2023-12-19 15:57:15,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=108, Invalid=444, Unknown=0, NotChecked=0, Total=552 [2023-12-19 15:57:15,608 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 390 mSDsluCounter, 805 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:15,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 927 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-19 15:57:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2023-12-19 15:57:15,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 487. [2023-12-19 15:57:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 455 states have (on average 1.3076923076923077) internal successors, (595), 456 states have internal predecessors, (595), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:57:15,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 647 transitions. [2023-12-19 15:57:15,654 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 647 transitions. Word has length 117 [2023-12-19 15:57:15,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:15,655 INFO L495 AbstractCegarLoop]: Abstraction has 487 states and 647 transitions. [2023-12-19 15:57:15,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.0) internal successors, (60), 15 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:57:15,655 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 647 transitions. [2023-12-19 15:57:15,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-19 15:57:15,655 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:15,655 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:15,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-12-19 15:57:15,656 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:15,656 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:15,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1835040287, now seen corresponding path program 1 times [2023-12-19 15:57:15,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:15,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420508306] [2023-12-19 15:57:15,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:15,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:15,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:16,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:16,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:16,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:16,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:16,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:16,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,301 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:16,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:16,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420508306] [2023-12-19 15:57:16,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420508306] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:16,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:16,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 15:57:16,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860953904] [2023-12-19 15:57:16,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:16,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 15:57:16,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:16,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 15:57:16,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:57:16,303 INFO L87 Difference]: Start difference. First operand 487 states and 647 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:57:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:16,802 INFO L93 Difference]: Finished difference Result 916 states and 1205 transitions. [2023-12-19 15:57:16,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:57:16,802 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-19 15:57:16,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:16,804 INFO L225 Difference]: With dead ends: 916 [2023-12-19 15:57:16,804 INFO L226 Difference]: Without dead ends: 584 [2023-12-19 15:57:16,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:57:16,805 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 334 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 435 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 435 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:16,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 648 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 435 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:57:16,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2023-12-19 15:57:16,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 453. [2023-12-19 15:57:16,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 421 states have (on average 1.299287410926366) internal successors, (547), 422 states have internal predecessors, (547), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:57:16,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 599 transitions. [2023-12-19 15:57:16,833 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 599 transitions. Word has length 117 [2023-12-19 15:57:16,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:16,833 INFO L495 AbstractCegarLoop]: Abstraction has 453 states and 599 transitions. [2023-12-19 15:57:16,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 9 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:57:16,834 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 599 transitions. [2023-12-19 15:57:16,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-19 15:57:16,834 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:16,834 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:16,834 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-12-19 15:57:16,834 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:16,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:16,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1486980389, now seen corresponding path program 1 times [2023-12-19 15:57:16,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:16,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658540338] [2023-12-19 15:57:16,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:16,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:16,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:16,945 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:16,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:16,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658540338] [2023-12-19 15:57:16,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658540338] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:16,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:16,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:57:16,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296789589] [2023-12-19 15:57:16,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:16,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:57:16,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:16,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:57:16,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:57:16,946 INFO L87 Difference]: Start difference. First operand 453 states and 599 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:57:17,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:17,068 INFO L93 Difference]: Finished difference Result 833 states and 1103 transitions. [2023-12-19 15:57:17,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:57:17,069 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2023-12-19 15:57:17,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:17,070 INFO L225 Difference]: With dead ends: 833 [2023-12-19 15:57:17,070 INFO L226 Difference]: Without dead ends: 525 [2023-12-19 15:57:17,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:57:17,071 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 135 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:17,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 388 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:57:17,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2023-12-19 15:57:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 465. [2023-12-19 15:57:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 433 states have (on average 1.300230946882217) internal successors, (563), 434 states have internal predecessors, (563), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:57:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 615 transitions. [2023-12-19 15:57:17,100 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 615 transitions. Word has length 118 [2023-12-19 15:57:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:17,101 INFO L495 AbstractCegarLoop]: Abstraction has 465 states and 615 transitions. [2023-12-19 15:57:17,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:57:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 615 transitions. [2023-12-19 15:57:17,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 15:57:17,101 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:17,101 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:17,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-12-19 15:57:17,102 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:17,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:17,102 INFO L85 PathProgramCache]: Analyzing trace with hash 877622157, now seen corresponding path program 1 times [2023-12-19 15:57:17,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:17,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906874012] [2023-12-19 15:57:17,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:17,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:17,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:18,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:18,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:18,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:18,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:18,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:18,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:18,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,078 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:18,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:18,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906874012] [2023-12-19 15:57:18,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906874012] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:18,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:18,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-19 15:57:18,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074347859] [2023-12-19 15:57:18,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:18,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 15:57:18,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:18,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 15:57:18,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:57:18,079 INFO L87 Difference]: Start difference. First operand 465 states and 615 transitions. Second operand has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:57:18,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:18,848 INFO L93 Difference]: Finished difference Result 855 states and 1129 transitions. [2023-12-19 15:57:18,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 15:57:18,849 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-12-19 15:57:18,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:18,850 INFO L225 Difference]: With dead ends: 855 [2023-12-19 15:57:18,850 INFO L226 Difference]: Without dead ends: 535 [2023-12-19 15:57:18,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=140, Invalid=460, Unknown=0, NotChecked=0, Total=600 [2023-12-19 15:57:18,851 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 450 mSDsluCounter, 936 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:18,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1079 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:57:18,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2023-12-19 15:57:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 471. [2023-12-19 15:57:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 439 states have (on average 1.296127562642369) internal successors, (569), 440 states have internal predecessors, (569), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:57:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 621 transitions. [2023-12-19 15:57:18,879 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 621 transitions. Word has length 119 [2023-12-19 15:57:18,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:18,879 INFO L495 AbstractCegarLoop]: Abstraction has 471 states and 621 transitions. [2023-12-19 15:57:18,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.428571428571429) internal successors, (62), 14 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:57:18,879 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 621 transitions. [2023-12-19 15:57:18,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-12-19 15:57:18,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:18,880 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:18,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-12-19 15:57:18,880 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:18,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:18,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1029086582, now seen corresponding path program 1 times [2023-12-19 15:57:18,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:18,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60322577] [2023-12-19 15:57:18,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:18,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:18,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:18,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:18,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:18,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:18,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:18,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:18,986 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:18,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:18,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60322577] [2023-12-19 15:57:18,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60322577] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:18,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:18,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:57:18,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308997506] [2023-12-19 15:57:18,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:18,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:57:18,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:18,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:57:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:57:18,987 INFO L87 Difference]: Start difference. First operand 471 states and 621 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:57:19,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:19,137 INFO L93 Difference]: Finished difference Result 852 states and 1114 transitions. [2023-12-19 15:57:19,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:57:19,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 119 [2023-12-19 15:57:19,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:19,140 INFO L225 Difference]: With dead ends: 852 [2023-12-19 15:57:19,140 INFO L226 Difference]: Without dead ends: 526 [2023-12-19 15:57:19,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:57:19,143 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 82 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:19,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 491 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:57:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2023-12-19 15:57:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 461. [2023-12-19 15:57:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 429 states have (on average 1.289044289044289) internal successors, (553), 430 states have internal predecessors, (553), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:57:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 605 transitions. [2023-12-19 15:57:19,171 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 605 transitions. Word has length 119 [2023-12-19 15:57:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:19,171 INFO L495 AbstractCegarLoop]: Abstraction has 461 states and 605 transitions. [2023-12-19 15:57:19,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-19 15:57:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 605 transitions. [2023-12-19 15:57:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-12-19 15:57:19,172 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:19,172 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:19,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-12-19 15:57:19,172 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:19,173 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:19,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1101082135, now seen corresponding path program 1 times [2023-12-19 15:57:19,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:19,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25262965] [2023-12-19 15:57:19,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:19,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:19,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:19,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:19,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:19,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:19,689 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:19,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:19,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25262965] [2023-12-19 15:57:19,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25262965] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:19,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:19,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:57:19,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32844591] [2023-12-19 15:57:19,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:19,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:57:19,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:57:19,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:57:19,690 INFO L87 Difference]: Start difference. First operand 461 states and 605 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:57:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:19,866 INFO L93 Difference]: Finished difference Result 787 states and 1027 transitions. [2023-12-19 15:57:19,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:57:19,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2023-12-19 15:57:19,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:19,868 INFO L225 Difference]: With dead ends: 787 [2023-12-19 15:57:19,868 INFO L226 Difference]: Without dead ends: 458 [2023-12-19 15:57:19,868 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-12-19 15:57:19,869 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 195 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:19,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 422 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:57:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2023-12-19 15:57:19,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 452. [2023-12-19 15:57:19,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 420 states have (on average 1.2833333333333334) internal successors, (539), 421 states have internal predecessors, (539), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:57:19,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 591 transitions. [2023-12-19 15:57:19,897 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 591 transitions. Word has length 120 [2023-12-19 15:57:19,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:19,897 INFO L495 AbstractCegarLoop]: Abstraction has 452 states and 591 transitions. [2023-12-19 15:57:19,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:57:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 591 transitions. [2023-12-19 15:57:19,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:57:19,898 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:19,898 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:19,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-12-19 15:57:19,898 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:19,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:19,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1942266646, now seen corresponding path program 1 times [2023-12-19 15:57:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:19,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544092325] [2023-12-19 15:57:19,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:19,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:22,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:22,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:22,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:22,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:22,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:22,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:22,095 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:22,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:22,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544092325] [2023-12-19 15:57:22,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544092325] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:22,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:22,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-12-19 15:57:22,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635582073] [2023-12-19 15:57:22,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:22,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-19 15:57:22,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:22,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-19 15:57:22,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2023-12-19 15:57:22,097 INFO L87 Difference]: Start difference. First operand 452 states and 591 transitions. Second operand has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:57:24,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:24,358 INFO L93 Difference]: Finished difference Result 916 states and 1195 transitions. [2023-12-19 15:57:24,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-19 15:57:24,358 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 123 [2023-12-19 15:57:24,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:24,360 INFO L225 Difference]: With dead ends: 916 [2023-12-19 15:57:24,360 INFO L226 Difference]: Without dead ends: 600 [2023-12-19 15:57:24,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2023-12-19 15:57:24,361 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 692 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 693 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:24,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [693 Valid, 950 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-19 15:57:24,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2023-12-19 15:57:24,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 516. [2023-12-19 15:57:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 484 states have (on average 1.2789256198347108) internal successors, (619), 485 states have internal predecessors, (619), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:57:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 671 transitions. [2023-12-19 15:57:24,401 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 671 transitions. Word has length 123 [2023-12-19 15:57:24,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:24,402 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 671 transitions. [2023-12-19 15:57:24,402 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 4.125) internal successors, (66), 17 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:57:24,402 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 671 transitions. [2023-12-19 15:57:24,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:57:24,402 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:24,403 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:24,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-12-19 15:57:24,403 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:24,403 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:24,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1132920020, now seen corresponding path program 1 times [2023-12-19 15:57:24,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:24,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045228866] [2023-12-19 15:57:24,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:24,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:24,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:25,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:25,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:25,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:25,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:25,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:25,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:25,321 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:25,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:25,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045228866] [2023-12-19 15:57:25,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045228866] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:25,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:25,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-19 15:57:25,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756888444] [2023-12-19 15:57:25,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:25,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 15:57:25,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:25,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 15:57:25,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-12-19 15:57:25,322 INFO L87 Difference]: Start difference. First operand 516 states and 671 transitions. Second operand has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:57:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:25,831 INFO L93 Difference]: Finished difference Result 985 states and 1276 transitions. [2023-12-19 15:57:25,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:57:25,832 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 123 [2023-12-19 15:57:25,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:25,833 INFO L225 Difference]: With dead ends: 985 [2023-12-19 15:57:25,833 INFO L226 Difference]: Without dead ends: 605 [2023-12-19 15:57:25,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-12-19 15:57:25,834 INFO L413 NwaCegarLoop]: 142 mSDtfsCounter, 246 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 536 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:25,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 544 Invalid, 536 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:57:25,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2023-12-19 15:57:25,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 516. [2023-12-19 15:57:25,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 484 states have (on average 1.274793388429752) internal successors, (617), 485 states have internal predecessors, (617), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:57:25,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 669 transitions. [2023-12-19 15:57:25,898 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 669 transitions. Word has length 123 [2023-12-19 15:57:25,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:25,898 INFO L495 AbstractCegarLoop]: Abstraction has 516 states and 669 transitions. [2023-12-19 15:57:25,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.6) internal successors, (66), 11 states have internal predecessors, (66), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-19 15:57:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 669 transitions. [2023-12-19 15:57:25,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:57:25,899 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:25,899 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:25,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-12-19 15:57:25,899 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:25,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:25,899 INFO L85 PathProgramCache]: Analyzing trace with hash -2077941036, now seen corresponding path program 1 times [2023-12-19 15:57:25,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:25,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423518560] [2023-12-19 15:57:25,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:25,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:25,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:26,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:26,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:26,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:26,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:26,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:26,670 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-19 15:57:26,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:26,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423518560] [2023-12-19 15:57:26,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423518560] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:57:26,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:57:26,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-19 15:57:26,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155725332] [2023-12-19 15:57:26,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:57:26,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-19 15:57:26,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:57:26,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-19 15:57:26,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:57:26,671 INFO L87 Difference]: Start difference. First operand 516 states and 669 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:57:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:57:27,083 INFO L93 Difference]: Finished difference Result 965 states and 1245 transitions. [2023-12-19 15:57:27,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-19 15:57:27,083 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2023-12-19 15:57:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:57:27,085 INFO L225 Difference]: With dead ends: 965 [2023-12-19 15:57:27,085 INFO L226 Difference]: Without dead ends: 585 [2023-12-19 15:57:27,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2023-12-19 15:57:27,086 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 312 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:57:27,086 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 474 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:57:27,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2023-12-19 15:57:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 520. [2023-12-19 15:57:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 520 states, 487 states have (on average 1.268993839835729) internal successors, (618), 488 states have internal predecessors, (618), 26 states have call successors, (26), 6 states have call predecessors, (26), 6 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-19 15:57:27,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 670 transitions. [2023-12-19 15:57:27,138 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 670 transitions. Word has length 123 [2023-12-19 15:57:27,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:57:27,138 INFO L495 AbstractCegarLoop]: Abstraction has 520 states and 670 transitions. [2023-12-19 15:57:27,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 states have internal predecessors, (66), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-19 15:57:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 670 transitions. [2023-12-19 15:57:27,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:57:27,139 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:57:27,139 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:57:27,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-12-19 15:57:27,139 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:57:27,139 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:57:27,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1407679634, now seen corresponding path program 1 times [2023-12-19 15:57:27,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:57:27,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118576970] [2023-12-19 15:57:27,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:27,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:57:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 15:57:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-19 15:57:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-19 15:57:31,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-19 15:57:31,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:57:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:57:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:57:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-19 15:57:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 15:57:31,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-19 15:57:31,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:57:31,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-19 15:57:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:31,452 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 30 proven. 30 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2023-12-19 15:57:31,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:57:31,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118576970] [2023-12-19 15:57:31,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118576970] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:57:31,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1221409622] [2023-12-19 15:57:31,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:57:31,453 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 15:57:31,453 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:57:31,467 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 15:57:31,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 15:57:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:57:32,340 INFO L262 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 106 conjunts are in the unsatisfiable core [2023-12-19 15:57:32,352 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 15:57:33,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-12-19 15:57:33,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-12-19 15:57:35,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2023-12-19 15:57:35,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2023-12-19 15:57:35,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2023-12-19 15:57:36,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 28 [2023-12-19 15:57:36,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2023-12-19 15:57:37,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 93 [2023-12-19 15:57:37,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 93 treesize of output 107 [2023-12-19 15:57:37,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:57:37,721 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:57:37,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:57:37,723 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:57:37,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 59 [2023-12-19 15:57:38,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:57:38,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:57:38,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:57:38,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-12-19 15:57:38,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 63 [2023-12-19 15:57:38,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 44 [2023-12-19 15:57:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 124 proven. 92 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2023-12-19 15:57:39,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 15:58:46,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1221409622] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-19 15:58:46,658 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 15:58:46,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 51 [2023-12-19 15:58:46,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444169375] [2023-12-19 15:58:46,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 15:58:46,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-12-19 15:58:46,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:58:46,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-12-19 15:58:46,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=3302, Unknown=10, NotChecked=0, Total=3660 [2023-12-19 15:58:46,660 INFO L87 Difference]: Start difference. First operand 520 states and 670 transitions. Second operand has 51 states, 45 states have (on average 3.2666666666666666) internal successors, (147), 48 states have internal predecessors, (147), 12 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) [2023-12-19 15:59:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:59:07,292 INFO L93 Difference]: Finished difference Result 1494 states and 1899 transitions. [2023-12-19 15:59:07,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2023-12-19 15:59:07,292 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 45 states have (on average 3.2666666666666666) internal successors, (147), 48 states have internal predecessors, (147), 12 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) Word has length 123 [2023-12-19 15:59:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:59:07,302 INFO L225 Difference]: With dead ends: 1494 [2023-12-19 15:59:07,302 INFO L226 Difference]: Without dead ends: 1114 [2023-12-19 15:59:07,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 281 GetRequests, 159 SyntacticMatches, 2 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3910 ImplicationChecksByTransitivity, 81.2s TimeCoverageRelationStatistics Valid=1764, Invalid=12988, Unknown=10, NotChecked=0, Total=14762 [2023-12-19 15:59:07,306 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 1557 mSDsluCounter, 3374 mSDsCounter, 0 mSdLazyCounter, 5071 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1561 SdHoareTripleChecker+Valid, 3509 SdHoareTripleChecker+Invalid, 5384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 5071 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-12-19 15:59:07,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1561 Valid, 3509 Invalid, 5384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 5071 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2023-12-19 15:59:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2023-12-19 15:59:07,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 935. [2023-12-19 15:59:07,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 868 states have (on average 1.2661290322580645) internal successors, (1099), 872 states have internal predecessors, (1099), 48 states have call successors, (48), 18 states have call predecessors, (48), 18 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-19 15:59:07,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1195 transitions. [2023-12-19 15:59:07,409 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1195 transitions. Word has length 123 [2023-12-19 15:59:07,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:59:07,409 INFO L495 AbstractCegarLoop]: Abstraction has 935 states and 1195 transitions. [2023-12-19 15:59:07,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 45 states have (on average 3.2666666666666666) internal successors, (147), 48 states have internal predecessors, (147), 12 states have call successors, (24), 6 states have call predecessors, (24), 8 states have return successors, (24), 9 states have call predecessors, (24), 12 states have call successors, (24) [2023-12-19 15:59:07,409 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1195 transitions. [2023-12-19 15:59:07,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2023-12-19 15:59:07,410 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:59:07,410 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:59:07,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 15:59:07,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-12-19 15:59:07,617 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:59:07,618 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:59:07,618 INFO L85 PathProgramCache]: Analyzing trace with hash -1907928189, now seen corresponding path program 1 times [2023-12-19 15:59:07,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:59:07,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858220195] [2023-12-19 15:59:07,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:59:07,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:59:07,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:59:07,663 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:59:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:59:07,754 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:59:07,754 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:59:07,755 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:59:07,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2023-12-19 15:59:07,758 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:59:07,761 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:59:07,857 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:59:07 BoogieIcfgContainer [2023-12-19 15:59:07,857 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:59:07,860 INFO L158 Benchmark]: Toolchain (without parser) took 154786.58ms. Allocated memory was 315.6MB in the beginning and 918.6MB in the end (delta: 602.9MB). Free memory was 274.1MB in the beginning and 621.4MB in the end (delta: -347.4MB). Peak memory consumption was 256.6MB. Max. memory is 8.0GB. [2023-12-19 15:59:07,862 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 178.3MB. Free memory was 127.3MB in the beginning and 127.2MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:59:07,862 INFO L158 Benchmark]: CACSL2BoogieTranslator took 266.37ms. Allocated memory is still 315.6MB. Free memory was 274.1MB in the beginning and 258.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-19 15:59:07,862 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.52ms. Allocated memory is still 315.6MB. Free memory was 258.9MB in the beginning and 255.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 15:59:07,862 INFO L158 Benchmark]: Boogie Preprocessor took 83.21ms. Allocated memory is still 315.6MB. Free memory was 255.2MB in the beginning and 251.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 15:59:07,862 INFO L158 Benchmark]: RCFGBuilder took 625.57ms. Allocated memory is still 315.6MB. Free memory was 251.0MB in the beginning and 219.0MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2023-12-19 15:59:07,863 INFO L158 Benchmark]: TraceAbstraction took 153758.35ms. Allocated memory was 315.6MB in the beginning and 918.6MB in the end (delta: 602.9MB). Free memory was 218.0MB in the beginning and 621.4MB in the end (delta: -403.5MB). Peak memory consumption was 201.0MB. Max. memory is 8.0GB. [2023-12-19 15:59:07,864 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.10ms. Allocated memory is still 178.3MB. Free memory was 127.3MB in the beginning and 127.2MB in the end (delta: 150.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 266.37ms. Allocated memory is still 315.6MB. Free memory was 274.1MB in the beginning and 258.9MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.52ms. Allocated memory is still 315.6MB. Free memory was 258.9MB in the beginning and 255.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 83.21ms. Allocated memory is still 315.6MB. Free memory was 255.2MB in the beginning and 251.0MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 625.57ms. Allocated memory is still 315.6MB. Free memory was 251.0MB in the beginning and 219.0MB in the end (delta: 32.0MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * TraceAbstraction took 153758.35ms. Allocated memory was 315.6MB in the beginning and 918.6MB in the end (delta: 602.9MB). Free memory was 218.0MB in the beginning and 621.4MB in the end (delta: -403.5MB). Peak memory consumption was 201.0MB. Max. memory is 8.0GB. * 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 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 120. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -128, 1, 1, 8, 1, 1885310857, -10, 32.6, 9.75, 5.1, 128.1, 63.9 }; [L51] signed char* WrapperStruct00_var_1_1_Pointer = &(WrapperStruct00.var_1_1); [L52] unsigned char* WrapperStruct00_var_1_2_Pointer = &(WrapperStruct00.var_1_2); [L53] unsigned char* WrapperStruct00_var_1_6_Pointer = &(WrapperStruct00.var_1_6); [L54] signed char* WrapperStruct00_var_1_7_Pointer = &(WrapperStruct00.var_1_7); [L55] unsigned long int* WrapperStruct00_var_1_8_Pointer = &(WrapperStruct00.var_1_8); [L56] unsigned long int* WrapperStruct00_var_1_9_Pointer = &(WrapperStruct00.var_1_9); [L57] signed long int* WrapperStruct00_var_1_10_Pointer = &(WrapperStruct00.var_1_10); [L58] double* WrapperStruct00_var_1_11_Pointer = &(WrapperStruct00.var_1_11); [L59] double* WrapperStruct00_var_1_12_Pointer = &(WrapperStruct00.var_1_12); [L60] double* WrapperStruct00_var_1_13_Pointer = &(WrapperStruct00.var_1_13); [L61] double* WrapperStruct00_var_1_14_Pointer = &(WrapperStruct00.var_1_14); [L62] double* WrapperStruct00_var_1_15_Pointer = &(WrapperStruct00.var_1_15); [L63] signed long int last_1_WrapperStruct00_var_1_10 = -10; [L124] isInitial = 1 [L125] FCALL initially() [L126] COND TRUE 1 [L127] CALL updateLastVariables() [L117] EXPR WrapperStruct00.var_1_10 [L117] last_1_WrapperStruct00_var_1_10 = WrapperStruct00.var_1_10 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L95] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L98] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L99] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L101] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L102] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -127) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L103] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 126) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L104] WrapperStruct00.var_1_9 = __VERIFIER_nondet_ulong() [L105] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1073741824) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L106] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 2147483647) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L107] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L108] EXPR WrapperStruct00.var_1_12 [L108] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L108] EXPR WrapperStruct00.var_1_12 [L108] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L108] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L109] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L110] EXPR WrapperStruct00.var_1_13 [L110] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L110] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L111] WrapperStruct00.var_1_14 = __VERIFIER_nondet_double() [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] EXPR (WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] CALL assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L112] RET assume_abort_if_not((WrapperStruct00.var_1_14 >= 0.0F && WrapperStruct00.var_1_14 <= -1.0e-20F) || (WrapperStruct00.var_1_14 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_14 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L113] WrapperStruct00.var_1_15 = __VERIFIER_nondet_double() [L114] EXPR WrapperStruct00.var_1_15 [L114] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F [L114] EXPR WrapperStruct00.var_1_15 [L114] EXPR WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] EXPR (WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] CALL assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L114] RET assume_abort_if_not((WrapperStruct00.var_1_15 >= 0.0F && WrapperStruct00.var_1_15 <= -1.0e-20F) || (WrapperStruct00.var_1_15 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_15 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L128] RET updateVariables() [L129] CALL step() [L67] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L67] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L70] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L70] EXPR ((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))) [L70] EXPR ((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L70] (*(WrapperStruct00_var_1_8_Pointer)) = ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))) [L72] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L72] COND FALSE !((*(WrapperStruct00_var_1_2_Pointer))) [L75] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L75] unsigned char stepLocal_1 = (*(WrapperStruct00_var_1_2_Pointer)); [L76] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L76] signed long int stepLocal_0 = (*(WrapperStruct00_var_1_10_Pointer)); [L77] stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0] [L77] stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L77] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L77] stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0] [L77] COND TRUE stepLocal_1 || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L78] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L78] COND FALSE !(stepLocal_0 < (*(WrapperStruct00_var_1_8_Pointer))) [L83] (*(WrapperStruct00_var_1_1_Pointer)) = 2 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L88] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L88] COND TRUE (*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer)) [L89] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L89] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L89] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L89] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L89] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10, stepLocal_0=-10, stepLocal_1=0] [L89] (*(WrapperStruct00_var_1_11_Pointer)) = ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) [L120] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) [L120] EXPR \read(*WrapperStruct00_var_1_10_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_8_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2)) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L120] EXPR ((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2)) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer)))))))) [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))) [L120] EXPR \read(*WrapperStruct00_var_1_8_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_9_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))) [L120] EXPR ((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1) [L120] EXPR \read(*WrapperStruct00_var_1_2_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1 [L120] EXPR (*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1 VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_1_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) [L120] EXPR \read(*WrapperStruct00_var_1_11_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_12_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_15_Pointer) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) [L120] EXPR \read(*WrapperStruct00_var_1_13_Pointer) [L120] EXPR \read(*WrapperStruct00_var_1_14_Pointer) [L120] EXPR ((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR ((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120] EXPR (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L120-L121] return (((((*(WrapperStruct00_var_1_2_Pointer)) || ((~ (*(WrapperStruct00_var_1_10_Pointer))) >= (*(WrapperStruct00_var_1_10_Pointer)))) ? (((*(WrapperStruct00_var_1_10_Pointer)) < (*(WrapperStruct00_var_1_8_Pointer))) ? ((! (*(WrapperStruct00_var_1_6_Pointer))) ? ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer)))) : 1) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) 2))) : ((*(WrapperStruct00_var_1_1_Pointer)) == ((signed char) (*(WrapperStruct00_var_1_7_Pointer))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((1514707036u + (((((*(WrapperStruct00_var_1_9_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_9_Pointer))) : ((*(WrapperStruct00_var_1_9_Pointer)))))) - last_1_WrapperStruct00_var_1_10))) : ((*(WrapperStruct00_var_1_8_Pointer)) == ((unsigned long int) ((((last_1_WrapperStruct00_var_1_10) > ((*(WrapperStruct00_var_1_9_Pointer)))) ? (last_1_WrapperStruct00_var_1_10) : ((*(WrapperStruct00_var_1_9_Pointer))))))))) && ((*(WrapperStruct00_var_1_2_Pointer)) ? ((*(WrapperStruct00_var_1_10_Pointer)) == ((signed long int) ((*(WrapperStruct00_var_1_8_Pointer)) + (((((*(WrapperStruct00_var_1_7_Pointer))) < 0 ) ? -((*(WrapperStruct00_var_1_7_Pointer))) : ((*(WrapperStruct00_var_1_7_Pointer)))))))) : 1)) && (((*(WrapperStruct00_var_1_1_Pointer)) >= (*(WrapperStruct00_var_1_1_Pointer))) ? ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) ((*(WrapperStruct00_var_1_12_Pointer)) - ((((((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) > ((*(WrapperStruct00_var_1_15_Pointer)))) ? (((*(WrapperStruct00_var_1_13_Pointer)) + (*(WrapperStruct00_var_1_14_Pointer)))) : ((*(WrapperStruct00_var_1_15_Pointer)))))))) : ((*(WrapperStruct00_var_1_11_Pointer)) == ((double) (((((*(WrapperStruct00_var_1_14_Pointer))) > ((*(WrapperStruct00_var_1_13_Pointer)))) ? ((*(WrapperStruct00_var_1_14_Pointer))) : ((*(WrapperStruct00_var_1_13_Pointer)))))))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] [L19] reach_error() VAL [WrapperStruct00={4:0}, WrapperStruct00_var_1_10_Pointer={4:12}, WrapperStruct00_var_1_11_Pointer={4:16}, WrapperStruct00_var_1_12_Pointer={4:24}, WrapperStruct00_var_1_13_Pointer={4:32}, WrapperStruct00_var_1_14_Pointer={4:40}, WrapperStruct00_var_1_15_Pointer={4:48}, WrapperStruct00_var_1_1_Pointer={4:0}, WrapperStruct00_var_1_2_Pointer={4:1}, WrapperStruct00_var_1_6_Pointer={4:2}, WrapperStruct00_var_1_7_Pointer={4:3}, WrapperStruct00_var_1_8_Pointer={4:4}, WrapperStruct00_var_1_9_Pointer={4:8}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_10=-10] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 106 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 153.6s, OverallIterations: 39, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 46.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 11885 SdHoareTripleChecker+Valid, 24.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 11877 mSDsluCounter, 28486 SdHoareTripleChecker+Invalid, 21.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 23155 mSDsCounter, 1170 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23762 IncrementalHoareTripleChecker+Invalid, 24932 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1170 mSolverCounterUnsat, 5331 mSDtfsCounter, 23762 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1781 GetRequests, 1174 SyntacticMatches, 22 SemanticMatches, 585 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5201 ImplicationChecksByTransitivity, 94.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=935occurred in iteration=38, InterpolantAutomatonStates: 423, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 38 MinimizatonAttempts, 3519 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 102.9s InterpolantComputationTime, 4625 NumberOfCodeBlocks, 4625 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 4463 ConstructedInterpolants, 0 QuantifiedInterpolants, 69818 SizeOfPredicates, 34 NumberOfNonLiveVariables, 472 ConjunctsInSsa, 106 ConjunctsInUnsatCore, 39 InterpolantComputations, 37 PerfectInterpolantSequences, 10174/10296 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 [2023-12-19 15:59:07,958 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...