/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 false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:29:01,791 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:29:01,874 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-16 04:29:01,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:29:01,881 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:29:01,909 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:29:01,910 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:29:01,910 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:29:01,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:29:01,916 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:29:01,916 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:29:01,917 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:29:01,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:29:01,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:29:01,919 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:29:01,920 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:29:01,920 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:29:01,920 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:29:01,920 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:29:01,921 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:29:01,921 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:29:01,921 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:29:01,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:29:01,922 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:29:01,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:29:01,922 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:29:01,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:29:01,923 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:29:01,923 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:29:01,923 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:29:01,924 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:29:01,924 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:29:01,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:29:01,925 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:29:01,925 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:29:01,925 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:29:01,925 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:29:01,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:29:01,926 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:29:01,926 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:29:01,926 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:29:01,926 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:29:01,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:29:01,927 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 -> false [2023-12-16 04:29:02,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:29:02,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:29:02,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:29:02,182 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:29:02,182 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:29:02,183 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i [2023-12-16 04:29:03,364 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:29:03,570 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:29:03,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-57.i [2023-12-16 04:29:03,580 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad57b849/abb4561a9c874f69b00ab434a3a4d275/FLAG748c61571 [2023-12-16 04:29:03,595 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ad57b849/abb4561a9c874f69b00ab434a3a4d275 [2023-12-16 04:29:03,597 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:29:03,599 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:29:03,600 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:29:03,600 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:29:03,604 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:29:03,605 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:03,606 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bb31e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03, skipping insertion in model container [2023-12-16 04:29:03,606 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:03,629 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:29:03,744 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-s_file-57.i[916,929] [2023-12-16 04:29:03,786 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:29:03,797 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:29:03,806 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-s_file-57.i[916,929] [2023-12-16 04:29:03,837 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:29:03,873 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:29:03,873 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03 WrapperNode [2023-12-16 04:29:03,873 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:29:03,874 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:29:03,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:29:03,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:29:03,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:03,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:03,938 INFO L138 Inliner]: procedures = 29, calls = 140, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 412 [2023-12-16 04:29:03,938 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:29:03,939 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:29:03,939 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:29:03,939 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:29:03,956 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:03,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:03,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:03,993 INFO L175 MemorySlicer]: Split 110 memory accesses to 2 slices as follows [2, 108]. 98 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 13]. The 17 writes are split as follows [0, 17]. [2023-12-16 04:29:03,994 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:03,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:04,021 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:04,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:04,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:04,045 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:04,055 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:29:04,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:29:04,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:29:04,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:29:04,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (1/1) ... [2023-12-16 04:29:04,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:29:04,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:29:04,090 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-16 04:29:04,092 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-16 04:29:04,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:29:04,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:29:04,113 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:29:04,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:29:04,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:29:04,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:29:04,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:29:04,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:29:04,114 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:29:04,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:29:04,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:29:04,114 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:29:04,114 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:29:04,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:29:04,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:29:04,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:29:04,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:29:04,216 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:29:04,217 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:29:04,673 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:29:04,720 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:29:04,721 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:29:04,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:29:04 BoogieIcfgContainer [2023-12-16 04:29:04,721 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:29:04,723 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:29:04,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:29:04,727 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:29:04,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:29:03" (1/3) ... [2023-12-16 04:29:04,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a415f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:29:04, skipping insertion in model container [2023-12-16 04:29:04,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:03" (2/3) ... [2023-12-16 04:29:04,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a415f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:29:04, skipping insertion in model container [2023-12-16 04:29:04,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:29:04" (3/3) ... [2023-12-16 04:29:04,732 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-57.i [2023-12-16 04:29:04,744 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:29:04,744 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:29:04,787 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:29:04,793 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;@253a45de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:29:04,793 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:29:04,797 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:29:04,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 04:29:04,808 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:04,809 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:04,809 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:04,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:04,813 INFO L85 PathProgramCache]: Analyzing trace with hash -649241732, now seen corresponding path program 1 times [2023-12-16 04:29:04,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:04,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742776534] [2023-12-16 04:29:04,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:04,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:04,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:05,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:05,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:05,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:05,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:05,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:05,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:05,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:05,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,247 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:05,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:05,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742776534] [2023-12-16 04:29:05,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742776534] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:05,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:05,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:29:05,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896785130] [2023-12-16 04:29:05,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:05,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:29:05,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:05,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:29:05,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:29:05,288 INFO L87 Difference]: Start difference. First operand has 90 states, 69 states have (on average 1.434782608695652) internal successors, (99), 70 states have internal predecessors, (99), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:29:05,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:05,345 INFO L93 Difference]: Finished difference Result 177 states and 286 transitions. [2023-12-16 04:29:05,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:29:05,348 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 129 [2023-12-16 04:29:05,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:05,357 INFO L225 Difference]: With dead ends: 177 [2023-12-16 04:29:05,358 INFO L226 Difference]: Without dead ends: 88 [2023-12-16 04:29:05,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-16 04:29:05,364 INFO L413 NwaCegarLoop]: 126 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, 126 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-16 04:29:05,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:05,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-16 04:29:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-16 04:29:05,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 68 states have (on average 1.3823529411764706) internal successors, (94), 68 states have internal predecessors, (94), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:29:05,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 130 transitions. [2023-12-16 04:29:05,402 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 130 transitions. Word has length 129 [2023-12-16 04:29:05,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:05,402 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 130 transitions. [2023-12-16 04:29:05,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:29:05,403 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 130 transitions. [2023-12-16 04:29:05,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 04:29:05,406 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:05,406 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:05,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:29:05,407 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:05,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:05,407 INFO L85 PathProgramCache]: Analyzing trace with hash -973939936, now seen corresponding path program 1 times [2023-12-16 04:29:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:05,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081891704] [2023-12-16 04:29:05,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:05,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:05,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:05,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:05,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:05,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:05,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:05,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:05,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:05,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:05,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:05,818 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:05,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:05,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081891704] [2023-12-16 04:29:05,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081891704] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:05,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:05,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:29:05,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031268760] [2023-12-16 04:29:05,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:05,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:29:05,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:05,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:29:05,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:29:05,827 INFO L87 Difference]: Start difference. First operand 88 states and 130 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:05,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:05,909 INFO L93 Difference]: Finished difference Result 179 states and 264 transitions. [2023-12-16 04:29:05,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:29:05,910 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2023-12-16 04:29:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:05,914 INFO L225 Difference]: With dead ends: 179 [2023-12-16 04:29:05,915 INFO L226 Difference]: Without dead ends: 92 [2023-12-16 04:29:05,917 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:05,919 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 3 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 366 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:05,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 366 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-16 04:29:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2023-12-16 04:29:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 70 states have internal predecessors, (96), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-16 04:29:05,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 132 transitions. [2023-12-16 04:29:05,940 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 132 transitions. Word has length 129 [2023-12-16 04:29:05,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:05,942 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 132 transitions. [2023-12-16 04:29:05,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:05,942 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 132 transitions. [2023-12-16 04:29:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2023-12-16 04:29:05,944 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:05,944 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:05,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:29:05,945 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:05,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:05,945 INFO L85 PathProgramCache]: Analyzing trace with hash -973880354, now seen corresponding path program 1 times [2023-12-16 04:29:05,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:05,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070516777] [2023-12-16 04:29:05,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:05,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:06,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:06,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:06,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:06,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:06,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:06,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:06,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:06,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:06,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:06,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:06,362 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:06,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:06,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070516777] [2023-12-16 04:29:06,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070516777] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:06,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:06,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:29:06,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859282443] [2023-12-16 04:29:06,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:06,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:29:06,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:06,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:29:06,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:29:06,365 INFO L87 Difference]: Start difference. First operand 90 states and 132 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:06,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:06,637 INFO L93 Difference]: Finished difference Result 269 states and 395 transitions. [2023-12-16 04:29:06,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 04:29:06,638 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 129 [2023-12-16 04:29:06,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:06,642 INFO L225 Difference]: With dead ends: 269 [2023-12-16 04:29:06,642 INFO L226 Difference]: Without dead ends: 180 [2023-12-16 04:29:06,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:06,648 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 95 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:06,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 279 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:06,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-16 04:29:06,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 148. [2023-12-16 04:29:06,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 109 states have (on average 1.3211009174311927) internal successors, (144), 109 states have internal predecessors, (144), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-16 04:29:06,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 216 transitions. [2023-12-16 04:29:06,693 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 216 transitions. Word has length 129 [2023-12-16 04:29:06,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:06,694 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 216 transitions. [2023-12-16 04:29:06,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:06,694 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 216 transitions. [2023-12-16 04:29:06,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-16 04:29:06,701 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:06,702 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:06,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:29:06,704 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:06,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:06,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1895747486, now seen corresponding path program 1 times [2023-12-16 04:29:06,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:06,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899161491] [2023-12-16 04:29:06,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:06,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:06,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:07,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:07,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:07,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:07,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:07,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:07,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:07,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:07,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:07,342 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:07,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:07,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899161491] [2023-12-16 04:29:07,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899161491] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:07,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:07,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:07,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020583404] [2023-12-16 04:29:07,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:07,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:07,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:07,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:07,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:07,345 INFO L87 Difference]: Start difference. First operand 148 states and 216 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:07,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:07,673 INFO L93 Difference]: Finished difference Result 320 states and 470 transitions. [2023-12-16 04:29:07,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:29:07,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2023-12-16 04:29:07,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:07,677 INFO L225 Difference]: With dead ends: 320 [2023-12-16 04:29:07,677 INFO L226 Difference]: Without dead ends: 231 [2023-12-16 04:29:07,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:29:07,682 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 163 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:07,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 421 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-12-16 04:29:07,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 183. [2023-12-16 04:29:07,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 144 states have (on average 1.3680555555555556) internal successors, (197), 144 states have internal predecessors, (197), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-16 04:29:07,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 269 transitions. [2023-12-16 04:29:07,706 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 269 transitions. Word has length 136 [2023-12-16 04:29:07,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:07,706 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 269 transitions. [2023-12-16 04:29:07,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:07,707 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 269 transitions. [2023-12-16 04:29:07,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-12-16 04:29:07,708 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:07,708 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:07,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:29:07,708 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:07,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:07,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1194682908, now seen corresponding path program 1 times [2023-12-16 04:29:07,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:07,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780955696] [2023-12-16 04:29:07,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:07,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:07,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:08,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:08,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:08,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:08,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:08,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:08,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:08,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,312 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:08,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:08,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780955696] [2023-12-16 04:29:08,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780955696] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:08,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:08,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-16 04:29:08,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209666407] [2023-12-16 04:29:08,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:08,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 04:29:08,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:08,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 04:29:08,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:29:08,316 INFO L87 Difference]: Start difference. First operand 183 states and 269 transitions. Second operand has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:08,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:08,581 INFO L93 Difference]: Finished difference Result 334 states and 492 transitions. [2023-12-16 04:29:08,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:29:08,582 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 136 [2023-12-16 04:29:08,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:08,584 INFO L225 Difference]: With dead ends: 334 [2023-12-16 04:29:08,584 INFO L226 Difference]: Without dead ends: 224 [2023-12-16 04:29:08,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:29:08,586 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 274 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:08,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 430 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:08,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-16 04:29:08,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 146. [2023-12-16 04:29:08,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 107 states have internal predecessors, (139), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-16 04:29:08,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2023-12-16 04:29:08,602 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 136 [2023-12-16 04:29:08,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:08,603 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2023-12-16 04:29:08,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.0) internal successors, (49), 7 states have internal predecessors, (49), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:08,603 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2023-12-16 04:29:08,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-16 04:29:08,604 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:08,604 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:08,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:29:08,604 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:08,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:08,605 INFO L85 PathProgramCache]: Analyzing trace with hash 877671551, now seen corresponding path program 1 times [2023-12-16 04:29:08,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:08,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231898842] [2023-12-16 04:29:08,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:08,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:08,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:08,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:09,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:09,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:09,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:09,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:09,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:09,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:09,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:09,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:09,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:09,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:09,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:09,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:09,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231898842] [2023-12-16 04:29:09,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231898842] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:09,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:09,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:29:09,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177370276] [2023-12-16 04:29:09,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:09,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:29:09,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:09,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:29:09,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:09,032 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:09,241 INFO L93 Difference]: Finished difference Result 307 states and 443 transitions. [2023-12-16 04:29:09,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:29:09,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2023-12-16 04:29:09,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:09,244 INFO L225 Difference]: With dead ends: 307 [2023-12-16 04:29:09,244 INFO L226 Difference]: Without dead ends: 204 [2023-12-16 04:29:09,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-16 04:29:09,245 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 82 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:09,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 356 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:09,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-16 04:29:09,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 154. [2023-12-16 04:29:09,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 115 states have (on average 1.3043478260869565) internal successors, (150), 115 states have internal predecessors, (150), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-16 04:29:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 222 transitions. [2023-12-16 04:29:09,267 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 222 transitions. Word has length 139 [2023-12-16 04:29:09,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:09,267 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 222 transitions. [2023-12-16 04:29:09,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 222 transitions. [2023-12-16 04:29:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-16 04:29:09,269 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:09,269 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:09,269 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:29:09,269 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:09,269 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:09,270 INFO L85 PathProgramCache]: Analyzing trace with hash 484644541, now seen corresponding path program 1 times [2023-12-16 04:29:09,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:09,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664026802] [2023-12-16 04:29:09,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:09,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:10,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:10,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:10,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:10,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:10,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:10,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:10,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:10,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:10,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:10,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:10,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:10,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:10,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:10,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:10,517 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:10,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:10,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664026802] [2023-12-16 04:29:10,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664026802] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:10,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:10,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:10,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382891358] [2023-12-16 04:29:10,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:10,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:10,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:10,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:10,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:10,519 INFO L87 Difference]: Start difference. First operand 154 states and 222 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:29:10,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:10,776 INFO L93 Difference]: Finished difference Result 321 states and 465 transitions. [2023-12-16 04:29:10,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:29:10,777 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 139 [2023-12-16 04:29:10,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:10,778 INFO L225 Difference]: With dead ends: 321 [2023-12-16 04:29:10,778 INFO L226 Difference]: Without dead ends: 210 [2023-12-16 04:29:10,779 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:29:10,779 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 56 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:10,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 354 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 291 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:10,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-12-16 04:29:10,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 164. [2023-12-16 04:29:10,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 125 states have (on average 1.32) internal successors, (165), 125 states have internal predecessors, (165), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-12-16 04:29:10,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 237 transitions. [2023-12-16 04:29:10,793 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 237 transitions. Word has length 139 [2023-12-16 04:29:10,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:10,794 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 237 transitions. [2023-12-16 04:29:10,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-12-16 04:29:10,794 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 237 transitions. [2023-12-16 04:29:10,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2023-12-16 04:29:10,796 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:10,796 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:10,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:29:10,796 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:10,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:10,796 INFO L85 PathProgramCache]: Analyzing trace with hash 907346367, now seen corresponding path program 1 times [2023-12-16 04:29:10,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:10,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295143488] [2023-12-16 04:29:10,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:10,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:12,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:12,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:12,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:12,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:12,477 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:12,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:12,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295143488] [2023-12-16 04:29:12,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295143488] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:12,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:12,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:12,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083928092] [2023-12-16 04:29:12,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:12,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:12,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:12,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:12,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:12,480 INFO L87 Difference]: Start difference. First operand 164 states and 237 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:12,867 INFO L93 Difference]: Finished difference Result 364 states and 524 transitions. [2023-12-16 04:29:12,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 04:29:12,867 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 139 [2023-12-16 04:29:12,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:12,869 INFO L225 Difference]: With dead ends: 364 [2023-12-16 04:29:12,869 INFO L226 Difference]: Without dead ends: 243 [2023-12-16 04:29:12,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:29:12,870 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 141 mSDsluCounter, 468 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:12,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 602 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-16 04:29:12,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-12-16 04:29:12,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 232. [2023-12-16 04:29:12,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 182 states have (on average 1.3186813186813187) internal successors, (240), 183 states have internal predecessors, (240), 46 states have call successors, (46), 3 states have call predecessors, (46), 3 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-16 04:29:12,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 332 transitions. [2023-12-16 04:29:12,892 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 332 transitions. Word has length 139 [2023-12-16 04:29:12,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:12,893 INFO L495 AbstractCegarLoop]: Abstraction has 232 states and 332 transitions. [2023-12-16 04:29:12,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:12,893 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 332 transitions. [2023-12-16 04:29:12,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:29:12,894 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:12,894 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:12,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:29:12,895 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:12,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:12,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2085631824, now seen corresponding path program 1 times [2023-12-16 04:29:12,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:12,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417719268] [2023-12-16 04:29:12,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:12,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:12,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:13,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:13,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:13,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:13,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:13,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:13,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:13,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:13,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:13,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:13,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:13,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:13,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:13,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,112 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:13,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:13,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417719268] [2023-12-16 04:29:13,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417719268] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:13,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:13,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:29:13,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938372064] [2023-12-16 04:29:13,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:13,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:29:13,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:13,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:29:13,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:13,114 INFO L87 Difference]: Start difference. First operand 232 states and 332 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:13,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:13,359 INFO L93 Difference]: Finished difference Result 562 states and 801 transitions. [2023-12-16 04:29:13,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:29:13,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-12-16 04:29:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:13,362 INFO L225 Difference]: With dead ends: 562 [2023-12-16 04:29:13,363 INFO L226 Difference]: Without dead ends: 373 [2023-12-16 04:29:13,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-16 04:29:13,364 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 116 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:13,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 494 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:13,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-12-16 04:29:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 289. [2023-12-16 04:29:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 234 states have (on average 1.3162393162393162) internal successors, (308), 236 states have internal predecessors, (308), 50 states have call successors, (50), 4 states have call predecessors, (50), 4 states have return successors, (50), 48 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-16 04:29:13,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 408 transitions. [2023-12-16 04:29:13,387 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 408 transitions. Word has length 140 [2023-12-16 04:29:13,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:13,390 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 408 transitions. [2023-12-16 04:29:13,390 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 408 transitions. [2023-12-16 04:29:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:29:13,392 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:13,392 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:13,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:29:13,392 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:13,393 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:13,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1074514574, now seen corresponding path program 1 times [2023-12-16 04:29:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:13,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099558392] [2023-12-16 04:29:13,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:13,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:13,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:13,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:13,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:13,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:13,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:13,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:13,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:13,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:13,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:13,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:13,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:13,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099558392] [2023-12-16 04:29:13,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099558392] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:13,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:13,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:29:13,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113680352] [2023-12-16 04:29:13,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:13,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:29:13,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:13,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:29:13,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:13,682 INFO L87 Difference]: Start difference. First operand 289 states and 408 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:13,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:13,899 INFO L93 Difference]: Finished difference Result 644 states and 901 transitions. [2023-12-16 04:29:13,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:29:13,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-12-16 04:29:13,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:13,902 INFO L225 Difference]: With dead ends: 644 [2023-12-16 04:29:13,902 INFO L226 Difference]: Without dead ends: 398 [2023-12-16 04:29:13,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-16 04:29:13,903 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 71 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:13,904 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 417 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:13,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2023-12-16 04:29:13,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 353. [2023-12-16 04:29:13,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 293 states have (on average 1.3003412969283277) internal successors, (381), 296 states have internal predecessors, (381), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 04:29:13,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 485 transitions. [2023-12-16 04:29:13,933 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 485 transitions. Word has length 140 [2023-12-16 04:29:13,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:13,933 INFO L495 AbstractCegarLoop]: Abstraction has 353 states and 485 transitions. [2023-12-16 04:29:13,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:13,933 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 485 transitions. [2023-12-16 04:29:13,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2023-12-16 04:29:13,935 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:13,935 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:13,935 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:29:13,935 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:13,935 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:13,936 INFO L85 PathProgramCache]: Analyzing trace with hash -120806318, now seen corresponding path program 1 times [2023-12-16 04:29:13,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:13,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962252313] [2023-12-16 04:29:13,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:13,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:13,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:14,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:14,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:14,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:14,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:14,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:14,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:14,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:14,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962252313] [2023-12-16 04:29:14,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962252313] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:14,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:14,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:29:14,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954642030] [2023-12-16 04:29:14,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:14,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:29:14,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:14,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:29:14,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:14,167 INFO L87 Difference]: Start difference. First operand 353 states and 485 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:14,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:14,362 INFO L93 Difference]: Finished difference Result 732 states and 1008 transitions. [2023-12-16 04:29:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:29:14,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 140 [2023-12-16 04:29:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:14,365 INFO L225 Difference]: With dead ends: 732 [2023-12-16 04:29:14,365 INFO L226 Difference]: Without dead ends: 422 [2023-12-16 04:29:14,366 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 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-16 04:29:14,366 INFO L413 NwaCegarLoop]: 138 mSDtfsCounter, 108 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:14,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 395 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-12-16 04:29:14,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 344. [2023-12-16 04:29:14,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 284 states have (on average 1.2922535211267605) internal successors, (367), 287 states have internal predecessors, (367), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 04:29:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 471 transitions. [2023-12-16 04:29:14,395 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 471 transitions. Word has length 140 [2023-12-16 04:29:14,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:14,396 INFO L495 AbstractCegarLoop]: Abstraction has 344 states and 471 transitions. [2023-12-16 04:29:14,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:14,397 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 471 transitions. [2023-12-16 04:29:14,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-16 04:29:14,398 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:14,398 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:14,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:29:14,398 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:14,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:14,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1944434102, now seen corresponding path program 1 times [2023-12-16 04:29:14,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:14,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109119014] [2023-12-16 04:29:14,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:14,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:14,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:14,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:14,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:14,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:14,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:14,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:14,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,485 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:14,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109119014] [2023-12-16 04:29:14,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109119014] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:14,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:14,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:29:14,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305820121] [2023-12-16 04:29:14,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:14,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:29:14,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:14,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:29:14,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:29:14,487 INFO L87 Difference]: Start difference. First operand 344 states and 471 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:14,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:14,523 INFO L93 Difference]: Finished difference Result 705 states and 966 transitions. [2023-12-16 04:29:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:29:14,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2023-12-16 04:29:14,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:14,526 INFO L225 Difference]: With dead ends: 705 [2023-12-16 04:29:14,526 INFO L226 Difference]: Without dead ends: 404 [2023-12-16 04:29:14,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 38 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-16 04:29:14,527 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 20 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:14,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 256 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-12-16 04:29:14,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 348. [2023-12-16 04:29:14,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 288 states have (on average 1.2881944444444444) internal successors, (371), 291 states have internal predecessors, (371), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 04:29:14,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 475 transitions. [2023-12-16 04:29:14,558 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 475 transitions. Word has length 142 [2023-12-16 04:29:14,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:14,558 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 475 transitions. [2023-12-16 04:29:14,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:14,558 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 475 transitions. [2023-12-16 04:29:14,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-16 04:29:14,560 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:14,560 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:14,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:29:14,560 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:14,560 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:14,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1243369524, now seen corresponding path program 1 times [2023-12-16 04:29:14,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:14,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632029847] [2023-12-16 04:29:14,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:14,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:14,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:14,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-16 04:29:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-16 04:29:14,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:14,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-16 04:29:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-12-16 04:29:14,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:14,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:14,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-12-16 04:29:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-12-16 04:29:14,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-12-16 04:29:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2023-12-16 04:29:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:14,763 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-12-16 04:29:14,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:14,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632029847] [2023-12-16 04:29:14,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632029847] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:14,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:14,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:14,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717891124] [2023-12-16 04:29:14,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:14,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:14,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:14,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:14,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:14,765 INFO L87 Difference]: Start difference. First operand 348 states and 475 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:14,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:14,835 INFO L93 Difference]: Finished difference Result 701 states and 958 transitions. [2023-12-16 04:29:14,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:29:14,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 142 [2023-12-16 04:29:14,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:14,838 INFO L225 Difference]: With dead ends: 701 [2023-12-16 04:29:14,838 INFO L226 Difference]: Without dead ends: 396 [2023-12-16 04:29:14,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-12-16 04:29:14,839 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 62 mSDsluCounter, 463 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 598 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:14,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 598 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:14,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2023-12-16 04:29:14,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 358. [2023-12-16 04:29:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 298 states have (on average 1.278523489932886) internal successors, (381), 301 states have internal predecessors, (381), 52 states have call successors, (52), 7 states have call predecessors, (52), 7 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2023-12-16 04:29:14,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 485 transitions. [2023-12-16 04:29:14,865 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 485 transitions. Word has length 142 [2023-12-16 04:29:14,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:14,865 INFO L495 AbstractCegarLoop]: Abstraction has 358 states and 485 transitions. [2023-12-16 04:29:14,865 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-12-16 04:29:14,866 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 485 transitions. [2023-12-16 04:29:14,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-16 04:29:14,867 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:14,867 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 04:29:14,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:29:14,867 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:14,868 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:14,868 INFO L85 PathProgramCache]: Analyzing trace with hash -1188932270, now seen corresponding path program 1 times [2023-12-16 04:29:14,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:14,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137011876] [2023-12-16 04:29:14,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:29:14,935 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:29:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:29:15,084 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:29:15,085 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:29:15,085 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:29:15,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:29:15,089 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:15,093 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:29:15,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:29:15 BoogieIcfgContainer [2023-12-16 04:29:15,186 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:29:15,186 INFO L158 Benchmark]: Toolchain (without parser) took 11587.45ms. Allocated memory was 201.3MB in the beginning and 400.6MB in the end (delta: 199.2MB). Free memory was 153.1MB in the beginning and 346.3MB in the end (delta: -193.2MB). Peak memory consumption was 223.7MB. Max. memory is 8.0GB. [2023-12-16 04:29:15,186 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:29:15,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.90ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 137.3MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. [2023-12-16 04:29:15,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.77ms. Allocated memory is still 201.3MB. Free memory was 137.3MB in the beginning and 133.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:29:15,187 INFO L158 Benchmark]: Boogie Preprocessor took 116.56ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 129.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:29:15,188 INFO L158 Benchmark]: RCFGBuilder took 664.97ms. Allocated memory is still 201.3MB. Free memory was 129.6MB in the beginning and 156.2MB in the end (delta: -26.5MB). Peak memory consumption was 19.4MB. Max. memory is 8.0GB. [2023-12-16 04:29:15,188 INFO L158 Benchmark]: TraceAbstraction took 10462.43ms. Allocated memory was 201.3MB in the beginning and 400.6MB in the end (delta: 199.2MB). Free memory was 155.6MB in the beginning and 346.3MB in the end (delta: -190.6MB). Peak memory consumption was 225.3MB. Max. memory is 8.0GB. [2023-12-16 04:29:15,190 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.14ms. Allocated memory is still 201.3MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 273.90ms. Allocated memory is still 201.3MB. Free memory was 152.7MB in the beginning and 137.3MB in the end (delta: 15.4MB). Peak memory consumption was 14.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 63.77ms. Allocated memory is still 201.3MB. Free memory was 137.3MB in the beginning and 133.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 116.56ms. Allocated memory is still 201.3MB. Free memory was 133.5MB in the beginning and 129.6MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 664.97ms. Allocated memory is still 201.3MB. Free memory was 129.6MB in the beginning and 156.2MB in the end (delta: -26.5MB). Peak memory consumption was 19.4MB. Max. memory is 8.0GB. * TraceAbstraction took 10462.43ms. Allocated memory was 201.3MB in the beginning and 400.6MB in the end (delta: 199.2MB). Free memory was 155.6MB in the beginning and 346.3MB in the end (delta: -190.6MB). Peak memory consumption was 225.3MB. 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 someBinaryFLOATComparisonOperation at line 119. Possible FailurePath: [L37] unsigned char isInitial = 0; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L38-L52] struct WrapperStruct00 WrapperStruct00 = { 1, 0, 0, 1, 64, 4, -4, 32, 32, -64, 50, 16, 63.5 }; [L53] signed char last_1_WrapperStruct00_var_1_9 = 64; [L54] signed char last_1_WrapperStruct00_var_1_14 = -64; [L123] isInitial = 1 [L124] FCALL initially() [L125] COND TRUE 1 [L126] CALL updateLastVariables() [L115] EXPR WrapperStruct00.var_1_9 [L115] last_1_WrapperStruct00_var_1_9 = WrapperStruct00.var_1_9 [L116] EXPR WrapperStruct00.var_1_14 [L116] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L126] RET updateLastVariables() [L127] CALL updateVariables() [L86] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L88] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L89] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L91] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L92] WrapperStruct00.var_1_6 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L94] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L95] WrapperStruct00.var_1_10 = __VERIFIER_nondet_char() [L96] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L97] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L98] WrapperStruct00.var_1_11 = __VERIFIER_nondet_char() [L99] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L101] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L102] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L104] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L105] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L107] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L108] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L109] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L110] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L111] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L112] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L127] RET updateVariables() [L128] CALL step() [L58] EXPR WrapperStruct00.var_1_6 [L58] unsigned char stepLocal_0 = WrapperStruct00.var_1_6; [L59] COND TRUE ! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9) [L60] EXPR WrapperStruct00.var_1_4 [L60] EXPR WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_0=1] [L60] EXPR WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L60] COND TRUE (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && stepLocal_0 [L61] WrapperStruct00.var_1_1 = ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L68] EXPR WrapperStruct00.var_1_15 [L68] EXPR WrapperStruct00.var_1_16 [L68] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L68] EXPR ((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13) [L68] EXPR ((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_0=1] [L68] signed long int stepLocal_3 = (WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))); [L69] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L69] COND TRUE WrapperStruct00.var_1_12 < stepLocal_3 [L70] EXPR WrapperStruct00.var_1_16 [L70] EXPR WrapperStruct00.var_1_13 [L70] WrapperStruct00.var_1_14 = ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13) [L74] WrapperStruct00.var_1_17 = 128.91f [L75] EXPR WrapperStruct00.var_1_14 [L75] EXPR WrapperStruct00.var_1_1 [L75] unsigned char stepLocal_2 = WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1; [L76] EXPR WrapperStruct00.var_1_5 [L76] unsigned char stepLocal_1 = WrapperStruct00.var_1_5; [L77] stepLocal_1 && WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64, stepLocal_0=1, stepLocal_1=0, stepLocal_2=0, stepLocal_3=45] [L77] stepLocal_1 && WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L77] COND FALSE !(stepLocal_1 && WrapperStruct00.var_1_4) [L82] EXPR WrapperStruct00.var_1_12 [L82] EXPR WrapperStruct00.var_1_13 [L82] WrapperStruct00.var_1_9 = (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13) [L128] RET step() [L129] CALL, EXPR property() [L119] EXPR (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14)) [L119] EXPR WrapperStruct00.var_1_4 [L119] EXPR WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6 [L119] EXPR WrapperStruct00.var_1_6 [L119] EXPR (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14)) [L119] EXPR WrapperStruct00.var_1_1 [L119] EXPR ((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)))) [L119] EXPR WrapperStruct00.var_1_5 [L119] EXPR WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))) [L119] EXPR WrapperStruct00.var_1_9 [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR (WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))) [L119] EXPR WrapperStruct00.var_1_12 [L119] EXPR WrapperStruct00.var_1_15 [L119] EXPR WrapperStruct00.var_1_16 [L119] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13) [L119] EXPR ((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) [L119] EXPR WrapperStruct00.var_1_14 [L119] EXPR WrapperStruct00.var_1_16 [L119] EXPR WrapperStruct00.var_1_13 [L119] EXPR (WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR (((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11)))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f)) [L119] EXPR WrapperStruct00.var_1_17 [L119] EXPR ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L119-L120] return ((((! (last_1_WrapperStruct00_var_1_14 >= last_1_WrapperStruct00_var_1_9)) ? (((WrapperStruct00.var_1_4 || WrapperStruct00.var_1_5) && WrapperStruct00.var_1_6) ? (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_9) < (last_1_WrapperStruct00_var_1_14)) ? (last_1_WrapperStruct00_var_1_9) : (last_1_WrapperStruct00_var_1_14))))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) : (WrapperStruct00.var_1_1 == ((signed long int) last_1_WrapperStruct00_var_1_14))) && ((WrapperStruct00.var_1_5 && WrapperStruct00.var_1_4) ? ((WrapperStruct00.var_1_6 || (WrapperStruct00.var_1_14 == WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_9 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))) : 1) : (WrapperStruct00.var_1_9 == ((signed char) (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_13))))) && ((WrapperStruct00.var_1_12 < ((WrapperStruct00.var_1_15 + WrapperStruct00.var_1_16) - ((((64) > (WrapperStruct00.var_1_13)) ? (64) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_14 == ((signed char) ((64 - WrapperStruct00.var_1_16) - WrapperStruct00.var_1_13))) : (WrapperStruct00.var_1_14 == ((signed char) ((((WrapperStruct00.var_1_10) < (WrapperStruct00.var_1_11)) ? (WrapperStruct00.var_1_10) : (WrapperStruct00.var_1_11))))))) && (WrapperStruct00.var_1_17 == ((float) 128.91f)) ; [L129] RET, EXPR property() [L129] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_14=-64, last_1_WrapperStruct00_var_1_9=64] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 90 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 14, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1192 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1191 mSDsluCounter, 5094 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3489 mSDsCounter, 112 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2056 IncrementalHoareTripleChecker+Invalid, 2168 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 112 mSolverCounterUnsat, 1605 mSDtfsCounter, 2056 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 602 GetRequests, 540 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=358occurred in iteration=13, InterpolantAutomatonStates: 78, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 568 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.8s InterpolantComputationTime, 1922 NumberOfCodeBlocks, 1922 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1767 ConstructedInterpolants, 0 QuantifiedInterpolants, 5230 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 7956/7956 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-16 04:29:15,222 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...