/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-70.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:29:36,936 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:29:37,008 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:37,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:29:37,015 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:29:37,040 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:29:37,040 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:29:37,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:29:37,041 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:29:37,044 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:29:37,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:29:37,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:29:37,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:29:37,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:29:37,047 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:29:37,047 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:29:37,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:29:37,047 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:29:37,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:29:37,048 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:29:37,048 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:29:37,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:29:37,049 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:29:37,049 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:29:37,050 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:29:37,050 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:29:37,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:29:37,050 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:29:37,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:29:37,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:29:37,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:29:37,052 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:29:37,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:29:37,052 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:29:37,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:29:37,052 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:29:37,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:29:37,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:29:37,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:29:37,053 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:29:37,053 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:29:37,053 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:29:37,053 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:29:37,053 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:37,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:29:37,262 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:29:37,263 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:29:37,264 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:29:37,264 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:29:37,265 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-70.i [2023-12-16 04:29:38,289 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:29:38,483 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:29:38,483 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-70.i [2023-12-16 04:29:38,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5998f023f/48af2072aca949939afa7cb7b462b4b5/FLAG2205f9b71 [2023-12-16 04:29:38,515 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5998f023f/48af2072aca949939afa7cb7b462b4b5 [2023-12-16 04:29:38,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:29:38,521 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:29:38,522 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:29:38,522 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:29:38,527 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:29:38,528 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:29:38" (1/1) ... [2023-12-16 04:29:38,529 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65630d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:38, skipping insertion in model container [2023-12-16 04:29:38,529 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:29:38" (1/1) ... [2023-12-16 04:29:38,557 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:29:38,684 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-70.i[916,929] [2023-12-16 04:29:38,744 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:29:38,754 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:29:38,765 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-70.i[916,929] [2023-12-16 04:29:38,812 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:29:38,830 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:29:38,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:38 WrapperNode [2023-12-16 04:29:38,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:29:38,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:29:38,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:29:38,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:29:38,838 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:38" (1/1) ... [2023-12-16 04:29:38,864 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:38" (1/1) ... [2023-12-16 04:29:38,901 INFO L138 Inliner]: procedures = 29, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2023-12-16 04:29:38,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:29:38,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:29:38,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:29:38,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:29:38,915 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:38" (1/1) ... [2023-12-16 04:29:38,916 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:38" (1/1) ... [2023-12-16 04:29:38,926 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:38" (1/1) ... [2023-12-16 04:29:38,947 INFO L175 MemorySlicer]: Split 132 memory accesses to 2 slices as follows [2, 130]. 98 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 14]. The 16 writes are split as follows [0, 16]. [2023-12-16 04:29:38,947 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:38" (1/1) ... [2023-12-16 04:29:38,947 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:38" (1/1) ... [2023-12-16 04:29:38,960 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:38" (1/1) ... [2023-12-16 04:29:38,963 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:38" (1/1) ... [2023-12-16 04:29:38,965 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:38" (1/1) ... [2023-12-16 04:29:38,967 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:38" (1/1) ... [2023-12-16 04:29:38,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:29:38,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:29:38,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:29:38,971 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:29:38,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:38" (1/1) ... [2023-12-16 04:29:38,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:29:38,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:29:39,018 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:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:29:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-16 04:29:39,039 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-16 04:29:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-16 04:29:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-16 04:29:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-16 04:29:39,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-16 04:29:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-16 04:29:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-16 04:29:39,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-16 04:29:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-16 04:29:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 04:29:39,042 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 04:29:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:29:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-16 04:29:39,042 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:29:39,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:29:39,035 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:39,134 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:29:39,135 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:29:39,439 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:29:39,463 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:29:39,463 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:29:39,463 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:29:39 BoogieIcfgContainer [2023-12-16 04:29:39,463 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:29:39,465 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:29:39,465 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:29:39,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:29:39,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:29:38" (1/3) ... [2023-12-16 04:29:39,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76339faa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:29:39, skipping insertion in model container [2023-12-16 04:29:39,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:29:38" (2/3) ... [2023-12-16 04:29:39,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76339faa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:29:39, skipping insertion in model container [2023-12-16 04:29:39,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:29:39" (3/3) ... [2023-12-16 04:29:39,469 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-70.i [2023-12-16 04:29:39,480 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:29:39,481 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:29:39,519 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:29:39,524 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;@4f948b05, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:29:39,525 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:29:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:29:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:29:39,539 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:39,540 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:39,540 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:39,548 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:39,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1508165923, now seen corresponding path program 1 times [2023-12-16 04:29:39,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:39,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174954674] [2023-12-16 04:29:39,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:39,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:39,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:39,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:39,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:39,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:39,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:39,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:39,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:39,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:39,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:39,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174954674] [2023-12-16 04:29:39,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174954674] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:39,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:39,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 04:29:39,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211799629] [2023-12-16 04:29:39,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:39,874 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 04:29:39,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:39,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 04:29:39,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:29:39,902 INFO L87 Difference]: Start difference. First operand has 94 states, 79 states have (on average 1.481012658227848) internal successors, (117), 80 states have internal predecessors, (117), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:29:39,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:39,947 INFO L93 Difference]: Finished difference Result 185 states and 292 transitions. [2023-12-16 04:29:39,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 04:29:39,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-16 04:29:39,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:39,955 INFO L225 Difference]: With dead ends: 185 [2023-12-16 04:29:39,956 INFO L226 Difference]: Without dead ends: 92 [2023-12-16 04:29:39,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 04:29:39,962 INFO L413 NwaCegarLoop]: 132 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, 132 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:39,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 132 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:39,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-16 04:29:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-12-16 04:29:39,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 78 states have (on average 1.435897435897436) internal successors, (112), 78 states have internal predecessors, (112), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:29:40,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 136 transitions. [2023-12-16 04:29:40,004 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 136 transitions. Word has length 110 [2023-12-16 04:29:40,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:40,005 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 136 transitions. [2023-12-16 04:29:40,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.5) internal successors, (53), 2 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:29:40,005 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 136 transitions. [2023-12-16 04:29:40,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:29:40,007 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:40,007 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:40,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-16 04:29:40,007 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:40,008 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:40,008 INFO L85 PathProgramCache]: Analyzing trace with hash 604001869, now seen corresponding path program 1 times [2023-12-16 04:29:40,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:40,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097063189] [2023-12-16 04:29:40,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:40,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:40,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:40,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:40,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:40,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:40,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:40,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:40,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:40,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,276 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:40,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:40,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097063189] [2023-12-16 04:29:40,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097063189] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:40,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:40,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:29:40,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458564859] [2023-12-16 04:29:40,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:40,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:29:40,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:40,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:29:40,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:29:40,285 INFO L87 Difference]: Start difference. First operand 92 states and 136 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:29:40,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:40,346 INFO L93 Difference]: Finished difference Result 189 states and 280 transitions. [2023-12-16 04:29:40,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:29:40,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 110 [2023-12-16 04:29:40,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:40,348 INFO L225 Difference]: With dead ends: 189 [2023-12-16 04:29:40,348 INFO L226 Difference]: Without dead ends: 98 [2023-12-16 04:29:40,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:40,350 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 10 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:40,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 388 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:40,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-16 04:29:40,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2023-12-16 04:29:40,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 80 states have (on average 1.425) internal successors, (114), 80 states have internal predecessors, (114), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:29:40,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2023-12-16 04:29:40,397 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 110 [2023-12-16 04:29:40,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:40,398 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2023-12-16 04:29:40,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:29:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2023-12-16 04:29:40,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-16 04:29:40,401 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:40,403 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:40,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-16 04:29:40,403 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:40,404 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:40,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1335969295, now seen corresponding path program 1 times [2023-12-16 04:29:40,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:40,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899438985] [2023-12-16 04:29:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:40,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:40,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:40,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:40,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:40,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:40,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:40,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:40,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:40,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,616 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:40,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:40,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899438985] [2023-12-16 04:29:40,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899438985] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:40,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:40,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:29:40,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242391835] [2023-12-16 04:29:40,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:40,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:29:40,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:40,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:29:40,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:29:40,622 INFO L87 Difference]: Start difference. First operand 94 states and 138 transitions. Second operand has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:40,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:40,671 INFO L93 Difference]: Finished difference Result 208 states and 307 transitions. [2023-12-16 04:29:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:29:40,671 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 110 [2023-12-16 04:29:40,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:40,674 INFO L225 Difference]: With dead ends: 208 [2023-12-16 04:29:40,674 INFO L226 Difference]: Without dead ends: 115 [2023-12-16 04:29:40,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 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:40,679 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 39 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:40,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 425 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:40,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-12-16 04:29:40,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 96. [2023-12-16 04:29:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.4146341463414633) internal successors, (116), 82 states have internal predecessors, (116), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:29:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 140 transitions. [2023-12-16 04:29:40,690 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 140 transitions. Word has length 110 [2023-12-16 04:29:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:40,690 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 140 transitions. [2023-12-16 04:29:40,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.25) internal successors, (53), 4 states have internal predecessors, (53), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:40,690 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 140 transitions. [2023-12-16 04:29:40,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:29:40,691 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:40,692 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:40,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-16 04:29:40,692 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:40,692 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:40,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1611607788, now seen corresponding path program 1 times [2023-12-16 04:29:40,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:40,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365594036] [2023-12-16 04:29:40,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:40,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:40,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:40,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:40,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:40,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:40,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:40,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:40,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365594036] [2023-12-16 04:29:40,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365594036] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:40,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:40,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:29:40,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859833800] [2023-12-16 04:29:40,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:40,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:29:40,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:40,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:29:40,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:29:40,840 INFO L87 Difference]: Start difference. First operand 96 states and 140 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:40,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:40,874 INFO L93 Difference]: Finished difference Result 199 states and 290 transitions. [2023-12-16 04:29:40,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:29:40,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-16 04:29:40,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:40,876 INFO L225 Difference]: With dead ends: 199 [2023-12-16 04:29:40,876 INFO L226 Difference]: Without dead ends: 104 [2023-12-16 04:29:40,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:40,881 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 12 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:40,882 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 384 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:40,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-16 04:29:40,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2023-12-16 04:29:40,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 84 states have internal predecessors, (118), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:29:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 142 transitions. [2023-12-16 04:29:40,893 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 142 transitions. Word has length 112 [2023-12-16 04:29:40,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:40,894 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 142 transitions. [2023-12-16 04:29:40,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:40,894 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 142 transitions. [2023-12-16 04:29:40,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:29:40,895 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:40,896 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:40,896 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-16 04:29:40,896 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:40,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:40,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1554349486, now seen corresponding path program 1 times [2023-12-16 04:29:40,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:40,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145369906] [2023-12-16 04:29:40,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:40,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:40,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:40,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:40,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:40,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:40,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:41,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:41,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,010 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:41,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:41,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145369906] [2023-12-16 04:29:41,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145369906] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:41,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:41,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 04:29:41,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787654605] [2023-12-16 04:29:41,010 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:41,010 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 04:29:41,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:41,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 04:29:41,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-16 04:29:41,011 INFO L87 Difference]: Start difference. First operand 98 states and 142 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:41,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:41,042 INFO L93 Difference]: Finished difference Result 199 states and 288 transitions. [2023-12-16 04:29:41,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 04:29:41,042 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-16 04:29:41,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:41,043 INFO L225 Difference]: With dead ends: 199 [2023-12-16 04:29:41,043 INFO L226 Difference]: Without dead ends: 102 [2023-12-16 04:29:41,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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:41,044 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 3 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:41,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 385 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-12-16 04:29:41,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2023-12-16 04:29:41,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:29:41,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 144 transitions. [2023-12-16 04:29:41,057 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 144 transitions. Word has length 112 [2023-12-16 04:29:41,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:41,057 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 144 transitions. [2023-12-16 04:29:41,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 144 transitions. [2023-12-16 04:29:41,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:29:41,059 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:41,059 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:41,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-16 04:29:41,059 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:41,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:41,060 INFO L85 PathProgramCache]: Analyzing trace with hash -1554289904, now seen corresponding path program 1 times [2023-12-16 04:29:41,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:41,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103421715] [2023-12-16 04:29:41,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:41,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:41,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:41,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:41,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:41,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:41,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,253 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:41,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:41,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103421715] [2023-12-16 04:29:41,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103421715] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:41,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:41,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 04:29:41,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500680309] [2023-12-16 04:29:41,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:41,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 04:29:41,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:41,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 04:29:41,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:29:41,255 INFO L87 Difference]: Start difference. First operand 100 states and 144 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:41,271 INFO L93 Difference]: Finished difference Result 199 states and 287 transitions. [2023-12-16 04:29:41,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 04:29:41,271 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-16 04:29:41,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:41,273 INFO L225 Difference]: With dead ends: 199 [2023-12-16 04:29:41,273 INFO L226 Difference]: Without dead ends: 100 [2023-12-16 04:29:41,273 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 04:29:41,274 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:41,274 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 258 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:41,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-12-16 04:29:41,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-12-16 04:29:41,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 86 states have (on average 1.3837209302325582) internal successors, (119), 86 states have internal predecessors, (119), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:29:41,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 143 transitions. [2023-12-16 04:29:41,279 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 143 transitions. Word has length 112 [2023-12-16 04:29:41,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:41,279 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 143 transitions. [2023-12-16 04:29:41,279 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, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:41,279 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 143 transitions. [2023-12-16 04:29:41,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:29:41,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:41,280 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:41,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-16 04:29:41,280 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:41,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:41,281 INFO L85 PathProgramCache]: Analyzing trace with hash 746532686, now seen corresponding path program 1 times [2023-12-16 04:29:41,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:41,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321573115] [2023-12-16 04:29:41,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:41,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:41,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:41,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:41,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:41,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:41,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:41,539 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:41,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:41,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321573115] [2023-12-16 04:29:41,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321573115] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:41,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:41,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:29:41,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689274517] [2023-12-16 04:29:41,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:41,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:29:41,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:41,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:29:41,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:41,541 INFO L87 Difference]: Start difference. First operand 100 states and 143 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:41,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:41,721 INFO L93 Difference]: Finished difference Result 246 states and 351 transitions. [2023-12-16 04:29:41,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:29:41,722 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 112 [2023-12-16 04:29:41,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:41,723 INFO L225 Difference]: With dead ends: 246 [2023-12-16 04:29:41,723 INFO L226 Difference]: Without dead ends: 147 [2023-12-16 04:29:41,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:41,724 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 53 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:41,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 334 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2023-12-16 04:29:41,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 103. [2023-12-16 04:29:41,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 89 states have (on average 1.3707865168539326) internal successors, (122), 89 states have internal predecessors, (122), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:29:41,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 146 transitions. [2023-12-16 04:29:41,729 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 146 transitions. Word has length 112 [2023-12-16 04:29:41,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:41,729 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 146 transitions. [2023-12-16 04:29:41,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 146 transitions. [2023-12-16 04:29:41,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-16 04:29:41,730 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:41,730 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:41,730 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-16 04:29:41,730 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:41,731 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:41,731 INFO L85 PathProgramCache]: Analyzing trace with hash -1192919154, now seen corresponding path program 1 times [2023-12-16 04:29:41,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:41,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794074744] [2023-12-16 04:29:41,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:41,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:42,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:42,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:42,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:42,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:42,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:42,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:42,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:42,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:42,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:42,619 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:42,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:42,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794074744] [2023-12-16 04:29:42,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794074744] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:42,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:42,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:42,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008159303] [2023-12-16 04:29:42,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:42,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:42,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:42,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:42,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:42,621 INFO L87 Difference]: Start difference. First operand 103 states and 146 transitions. Second operand has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:29:42,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:42,800 INFO L93 Difference]: Finished difference Result 268 states and 378 transitions. [2023-12-16 04:29:42,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:29:42,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 112 [2023-12-16 04:29:42,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:42,802 INFO L225 Difference]: With dead ends: 268 [2023-12-16 04:29:42,802 INFO L226 Difference]: Without dead ends: 166 [2023-12-16 04:29:42,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 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:42,804 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 143 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:42,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 364 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:42,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-16 04:29:42,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 113. [2023-12-16 04:29:42,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3636363636363635) internal successors, (135), 99 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:29:42,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 159 transitions. [2023-12-16 04:29:42,809 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 159 transitions. Word has length 112 [2023-12-16 04:29:42,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:42,809 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 159 transitions. [2023-12-16 04:29:42,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.0) internal successors, (55), 6 states have internal predecessors, (55), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:29:42,810 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 159 transitions. [2023-12-16 04:29:42,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:29:42,812 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:42,812 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:42,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-16 04:29:42,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:42,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:42,813 INFO L85 PathProgramCache]: Analyzing trace with hash 243771707, now seen corresponding path program 1 times [2023-12-16 04:29:42,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:42,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773059173] [2023-12-16 04:29:42,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:42,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:42,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:43,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:43,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:43,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:43,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,034 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:43,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:43,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773059173] [2023-12-16 04:29:43,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773059173] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:43,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:43,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:29:43,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770001562] [2023-12-16 04:29:43,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:43,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:29:43,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:43,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:29:43,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:43,036 INFO L87 Difference]: Start difference. First operand 113 states and 159 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:43,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:43,188 INFO L93 Difference]: Finished difference Result 275 states and 386 transitions. [2023-12-16 04:29:43,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:29:43,188 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-16 04:29:43,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:43,189 INFO L225 Difference]: With dead ends: 275 [2023-12-16 04:29:43,189 INFO L226 Difference]: Without dead ends: 163 [2023-12-16 04:29:43,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:29:43,191 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 146 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 358 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:43,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 358 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:29:43,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-12-16 04:29:43,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 115. [2023-12-16 04:29:43,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:29:43,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 161 transitions. [2023-12-16 04:29:43,195 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 161 transitions. Word has length 113 [2023-12-16 04:29:43,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:43,195 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 161 transitions. [2023-12-16 04:29:43,195 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:43,195 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 161 transitions. [2023-12-16 04:29:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-16 04:29:43,196 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:43,196 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:43,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-16 04:29:43,196 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:43,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:43,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1354151557, now seen corresponding path program 1 times [2023-12-16 04:29:43,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:43,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341096619] [2023-12-16 04:29:43,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:43,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:43,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:43,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:43,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:43,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:43,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:43,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:43,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:43,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:43,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:43,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:43,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:43,315 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:43,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:43,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341096619] [2023-12-16 04:29:43,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341096619] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:43,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:43,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:29:43,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975758891] [2023-12-16 04:29:43,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:43,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 04:29:43,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:43,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 04:29:43,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 04:29:43,316 INFO L87 Difference]: Start difference. First operand 115 states and 161 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:43,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:43,358 INFO L93 Difference]: Finished difference Result 250 states and 350 transitions. [2023-12-16 04:29:43,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:29:43,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2023-12-16 04:29:43,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:43,360 INFO L225 Difference]: With dead ends: 250 [2023-12-16 04:29:43,360 INFO L226 Difference]: Without dead ends: 136 [2023-12-16 04:29:43,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:29:43,360 INFO L413 NwaCegarLoop]: 140 mSDtfsCounter, 64 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:43,361 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 516 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:29:43,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-12-16 04:29:43,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 118. [2023-12-16 04:29:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 104 states have (on average 1.3461538461538463) internal successors, (140), 104 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:29:43,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 164 transitions. [2023-12-16 04:29:43,365 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 164 transitions. Word has length 113 [2023-12-16 04:29:43,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:43,365 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 164 transitions. [2023-12-16 04:29:43,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:29:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 164 transitions. [2023-12-16 04:29:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:29:43,367 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:43,367 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:43,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-16 04:29:43,367 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:43,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:43,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1707101395, now seen corresponding path program 1 times [2023-12-16 04:29:43,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:43,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383023868] [2023-12-16 04:29:43,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:43,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:43,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:44,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:44,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:44,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:44,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:44,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:44,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:44,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383023868] [2023-12-16 04:29:44,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383023868] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:44,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:44,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:29:44,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270202694] [2023-12-16 04:29:44,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:44,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:29:44,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:44,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:29:44,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:29:44,725 INFO L87 Difference]: Start difference. First operand 118 states and 164 transitions. Second operand has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:29:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:45,636 INFO L93 Difference]: Finished difference Result 412 states and 570 transitions. [2023-12-16 04:29:45,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 04:29:45,637 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2023-12-16 04:29:45,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:45,638 INFO L225 Difference]: With dead ends: 412 [2023-12-16 04:29:45,638 INFO L226 Difference]: Without dead ends: 295 [2023-12-16 04:29:45,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:29:45,639 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 257 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 950 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 950 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:45,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1100 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 950 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 04:29:45,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2023-12-16 04:29:45,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 136. [2023-12-16 04:29:45,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 122 states have internal predecessors, (165), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-16 04:29:45,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 189 transitions. [2023-12-16 04:29:45,644 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 189 transitions. Word has length 114 [2023-12-16 04:29:45,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:45,644 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 189 transitions. [2023-12-16 04:29:45,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.333333333333333) internal successors, (57), 10 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:29:45,644 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 189 transitions. [2023-12-16 04:29:45,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:29:45,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:45,645 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:45,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-16 04:29:45,645 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:45,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:45,646 INFO L85 PathProgramCache]: Analyzing trace with hash 427237717, now seen corresponding path program 1 times [2023-12-16 04:29:45,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:45,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125812890] [2023-12-16 04:29:45,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:45,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:45,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:46,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:46,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:46,481 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:46,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:46,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125812890] [2023-12-16 04:29:46,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125812890] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:46,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:46,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:46,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716790968] [2023-12-16 04:29:46,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:46,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:46,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:46,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:46,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:46,482 INFO L87 Difference]: Start difference. First operand 136 states and 189 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:29:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:46,752 INFO L93 Difference]: Finished difference Result 366 states and 501 transitions. [2023-12-16 04:29:46,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-16 04:29:46,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2023-12-16 04:29:46,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:46,754 INFO L225 Difference]: With dead ends: 366 [2023-12-16 04:29:46,754 INFO L226 Difference]: Without dead ends: 231 [2023-12-16 04:29:46,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:29:46,755 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 109 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:46,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 600 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-12-16 04:29:46,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 176. [2023-12-16 04:29:46,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 159 states have (on average 1.3333333333333333) internal successors, (212), 160 states have internal predecessors, (212), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:29:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 240 transitions. [2023-12-16 04:29:46,763 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 240 transitions. Word has length 114 [2023-12-16 04:29:46,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:46,763 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 240 transitions. [2023-12-16 04:29:46,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:29:46,763 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 240 transitions. [2023-12-16 04:29:46,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:29:46,764 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:46,764 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:46,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-16 04:29:46,764 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:46,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:46,765 INFO L85 PathProgramCache]: Analyzing trace with hash -664637867, now seen corresponding path program 1 times [2023-12-16 04:29:46,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:46,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091368734] [2023-12-16 04:29:46,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:46,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:47,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:47,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:47,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:47,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:47,361 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:47,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:47,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091368734] [2023-12-16 04:29:47,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091368734] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:47,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:47,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:29:47,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496303118] [2023-12-16 04:29:47,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:47,362 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:29:47,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:47,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:29:47,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:29:47,363 INFO L87 Difference]: Start difference. First operand 176 states and 240 transitions. Second operand has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:29:47,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:47,608 INFO L93 Difference]: Finished difference Result 411 states and 554 transitions. [2023-12-16 04:29:47,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-16 04:29:47,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2023-12-16 04:29:47,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:47,610 INFO L225 Difference]: With dead ends: 411 [2023-12-16 04:29:47,610 INFO L226 Difference]: Without dead ends: 236 [2023-12-16 04:29:47,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:29:47,612 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 112 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:47,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 499 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:29:47,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-12-16 04:29:47,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 171. [2023-12-16 04:29:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 154 states have (on average 1.3181818181818181) internal successors, (203), 155 states have internal predecessors, (203), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:29:47,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 231 transitions. [2023-12-16 04:29:47,621 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 231 transitions. Word has length 114 [2023-12-16 04:29:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:47,624 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 231 transitions. [2023-12-16 04:29:47,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 11.4) internal successors, (57), 6 states have internal predecessors, (57), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:29:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 231 transitions. [2023-12-16 04:29:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:29:47,625 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:47,625 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:47,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-16 04:29:47,625 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:47,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1944501545, now seen corresponding path program 1 times [2023-12-16 04:29:47,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:47,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614773269] [2023-12-16 04:29:47,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:47,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:29:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:29:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:29:48,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:29:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:29:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:29:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:29:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:29:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:29:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:29:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:29:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:29:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:29:48,710 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:29:48,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:29:48,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614773269] [2023-12-16 04:29:48,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614773269] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:29:48,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:29:48,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:29:48,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534986871] [2023-12-16 04:29:48,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:29:48,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:29:48,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:29:48,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:29:48,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:29:48,712 INFO L87 Difference]: Start difference. First operand 171 states and 231 transitions. Second operand has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:29:49,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:29:49,824 INFO L93 Difference]: Finished difference Result 432 states and 575 transitions. [2023-12-16 04:29:49,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 04:29:49,825 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2023-12-16 04:29:49,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:29:49,826 INFO L225 Difference]: With dead ends: 432 [2023-12-16 04:29:49,826 INFO L226 Difference]: Without dead ends: 261 [2023-12-16 04:29:49,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:29:49,827 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 118 mSDsluCounter, 759 mSDsCounter, 0 mSdLazyCounter, 885 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:29:49,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 915 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 885 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 04:29:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-12-16 04:29:49,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 180. [2023-12-16 04:29:49,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 163 states have (on average 1.3190184049079754) internal successors, (215), 164 states have internal predecessors, (215), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:29:49,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 243 transitions. [2023-12-16 04:29:49,838 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 243 transitions. Word has length 114 [2023-12-16 04:29:49,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:29:49,839 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 243 transitions. [2023-12-16 04:29:49,839 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.125) internal successors, (57), 10 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:29:49,839 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 243 transitions. [2023-12-16 04:29:49,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-16 04:29:49,840 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:29:49,840 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:29:49,840 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-12-16 04:29:49,840 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:29:49,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:29:49,840 INFO L85 PathProgramCache]: Analyzing trace with hash 545027417, now seen corresponding path program 1 times [2023-12-16 04:29:49,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:29:49,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849607742] [2023-12-16 04:29:49,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:29:49,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:29:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:09,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:30:09,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:30:09,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:09,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:09,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:30:09,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:09,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849607742] [2023-12-16 04:30:09,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849607742] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:09,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:09,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-12-16 04:30:09,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447162842] [2023-12-16 04:30:09,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:09,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-16 04:30:09,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:09,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-16 04:30:09,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:30:09,067 INFO L87 Difference]: Start difference. First operand 180 states and 243 transitions. Second operand has 11 states, 9 states have (on average 6.333333333333333) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:30:11,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:11,634 INFO L93 Difference]: Finished difference Result 446 states and 597 transitions. [2023-12-16 04:30:11,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-16 04:30:11,635 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 6.333333333333333) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 114 [2023-12-16 04:30:11,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:11,636 INFO L225 Difference]: With dead ends: 446 [2023-12-16 04:30:11,636 INFO L226 Difference]: Without dead ends: 267 [2023-12-16 04:30:11,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2023-12-16 04:30:11,637 INFO L413 NwaCegarLoop]: 156 mSDtfsCounter, 167 mSDsluCounter, 900 mSDsCounter, 0 mSdLazyCounter, 891 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 891 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:11,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1056 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 891 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 04:30:11,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-12-16 04:30:11,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 177. [2023-12-16 04:30:11,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 160 states have (on average 1.31875) internal successors, (211), 161 states have internal predecessors, (211), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-16 04:30:11,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 239 transitions. [2023-12-16 04:30:11,644 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 239 transitions. Word has length 114 [2023-12-16 04:30:11,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:11,644 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 239 transitions. [2023-12-16 04:30:11,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 6.333333333333333) internal successors, (57), 11 states have internal predecessors, (57), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:30:11,645 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2023-12-16 04:30:11,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-12-16 04:30:11,645 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:11,645 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:11,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-12-16 04:30:11,646 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:11,646 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:11,646 INFO L85 PathProgramCache]: Analyzing trace with hash 159456928, now seen corresponding path program 1 times [2023-12-16 04:30:11,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:11,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15532738] [2023-12-16 04:30:11,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:11,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:11,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:30:13,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:13,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:30:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:13,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:13,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:13,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:13,758 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:30:13,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:13,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15532738] [2023-12-16 04:30:13,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15532738] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:13,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:13,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-12-16 04:30:13,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614285868] [2023-12-16 04:30:13,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:13,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 04:30:13,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:13,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 04:30:13,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:30:13,760 INFO L87 Difference]: Start difference. First operand 177 states and 239 transitions. Second operand has 14 states, 11 states have (on average 5.363636363636363) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-16 04:30:14,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:14,561 INFO L93 Difference]: Finished difference Result 511 states and 683 transitions. [2023-12-16 04:30:14,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 04:30:14,562 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 5.363636363636363) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 116 [2023-12-16 04:30:14,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:14,563 INFO L225 Difference]: With dead ends: 511 [2023-12-16 04:30:14,563 INFO L226 Difference]: Without dead ends: 335 [2023-12-16 04:30:14,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=90, Invalid=330, Unknown=0, NotChecked=0, Total=420 [2023-12-16 04:30:14,564 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 191 mSDsluCounter, 792 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:14,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 895 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-16 04:30:14,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-12-16 04:30:14,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 310. [2023-12-16 04:30:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 277 states have (on average 1.2996389891696751) internal successors, (360), 279 states have internal predecessors, (360), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 04:30:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 416 transitions. [2023-12-16 04:30:14,582 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 416 transitions. Word has length 116 [2023-12-16 04:30:14,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:14,584 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 416 transitions. [2023-12-16 04:30:14,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 5.363636363636363) internal successors, (59), 14 states have internal predecessors, (59), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-16 04:30:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 416 transitions. [2023-12-16 04:30:14,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:30:14,585 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:14,585 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:14,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-12-16 04:30:14,585 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:14,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:14,585 INFO L85 PathProgramCache]: Analyzing trace with hash 621685809, now seen corresponding path program 1 times [2023-12-16 04:30:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:14,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033941400] [2023-12-16 04:30:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:14,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:30:14,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:30:14,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:14,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:14,845 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:30:14,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:14,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033941400] [2023-12-16 04:30:14,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033941400] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:14,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:14,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:30:14,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499438786] [2023-12-16 04:30:14,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:14,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:30:14,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:14,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:30:14,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:30:14,846 INFO L87 Difference]: Start difference. First operand 310 states and 416 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:30:15,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:15,068 INFO L93 Difference]: Finished difference Result 671 states and 905 transitions. [2023-12-16 04:30:15,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:30:15,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2023-12-16 04:30:15,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:15,079 INFO L225 Difference]: With dead ends: 671 [2023-12-16 04:30:15,079 INFO L226 Difference]: Without dead ends: 495 [2023-12-16 04:30:15,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-16 04:30:15,079 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 184 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:15,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 799 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:30:15,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2023-12-16 04:30:15,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 472. [2023-12-16 04:30:15,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 423 states have (on average 1.3073286052009456) internal successors, (553), 426 states have internal predecessors, (553), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:30:15,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 637 transitions. [2023-12-16 04:30:15,100 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 637 transitions. Word has length 117 [2023-12-16 04:30:15,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:15,101 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 637 transitions. [2023-12-16 04:30:15,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2023-12-16 04:30:15,101 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 637 transitions. [2023-12-16 04:30:15,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:30:15,102 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:15,102 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:15,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-12-16 04:30:15,102 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:15,102 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:15,102 INFO L85 PathProgramCache]: Analyzing trace with hash 683725423, now seen corresponding path program 1 times [2023-12-16 04:30:15,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:15,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848806515] [2023-12-16 04:30:15,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:15,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:15,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:16,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:30:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:30:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:16,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:16,823 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:30:16,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:16,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848806515] [2023-12-16 04:30:16,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848806515] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:16,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:16,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-12-16 04:30:16,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679716126] [2023-12-16 04:30:16,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:16,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 04:30:16,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:16,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 04:30:16,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:30:16,825 INFO L87 Difference]: Start difference. First operand 472 states and 637 transitions. Second operand has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:30:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:18,600 INFO L93 Difference]: Finished difference Result 1309 states and 1760 transitions. [2023-12-16 04:30:18,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 04:30:18,601 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-16 04:30:18,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:18,604 INFO L225 Difference]: With dead ends: 1309 [2023-12-16 04:30:18,604 INFO L226 Difference]: Without dead ends: 971 [2023-12-16 04:30:18,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=98, Invalid=408, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:30:18,605 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 262 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 1112 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 778 SdHoareTripleChecker+Invalid, 1136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:18,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 778 Invalid, 1136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1112 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-16 04:30:18,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2023-12-16 04:30:18,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 500. [2023-12-16 04:30:18,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 451 states have (on average 1.310421286031042) internal successors, (591), 454 states have internal predecessors, (591), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:30:18,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 675 transitions. [2023-12-16 04:30:18,632 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 675 transitions. Word has length 117 [2023-12-16 04:30:18,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:18,632 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 675 transitions. [2023-12-16 04:30:18,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.454545454545454) internal successors, (60), 13 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:30:18,632 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 675 transitions. [2023-12-16 04:30:18,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:30:18,633 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:18,633 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:18,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-12-16 04:30:18,634 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:18,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:18,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1688013839, now seen corresponding path program 1 times [2023-12-16 04:30:18,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:18,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526044359] [2023-12-16 04:30:18,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:18,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:30:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:30:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:19,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:19,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:19,123 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:30:19,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:19,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526044359] [2023-12-16 04:30:19,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526044359] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:19,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:19,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:30:19,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857360676] [2023-12-16 04:30:19,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:19,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:30:19,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:19,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:30:19,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:30:19,126 INFO L87 Difference]: Start difference. First operand 500 states and 675 transitions. Second operand has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:30:19,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:19,343 INFO L93 Difference]: Finished difference Result 854 states and 1155 transitions. [2023-12-16 04:30:19,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:30:19,344 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2023-12-16 04:30:19,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:19,346 INFO L225 Difference]: With dead ends: 854 [2023-12-16 04:30:19,346 INFO L226 Difference]: Without dead ends: 488 [2023-12-16 04:30:19,346 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:19,347 INFO L413 NwaCegarLoop]: 129 mSDtfsCounter, 52 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:19,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 479 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:30:19,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2023-12-16 04:30:19,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 486. [2023-12-16 04:30:19,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 437 states have (on average 1.3020594965675056) internal successors, (569), 440 states have internal predecessors, (569), 42 states have call successors, (42), 6 states have call predecessors, (42), 6 states have return successors, (42), 39 states have call predecessors, (42), 42 states have call successors, (42) [2023-12-16 04:30:19,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 653 transitions. [2023-12-16 04:30:19,368 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 653 transitions. Word has length 117 [2023-12-16 04:30:19,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:19,369 INFO L495 AbstractCegarLoop]: Abstraction has 486 states and 653 transitions. [2023-12-16 04:30:19,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.0) internal successors, (60), 6 states have internal predecessors, (60), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:30:19,369 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 653 transitions. [2023-12-16 04:30:19,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-12-16 04:30:19,369 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:19,370 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:19,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-12-16 04:30:19,370 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:19,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:19,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1287787029, now seen corresponding path program 1 times [2023-12-16 04:30:19,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:19,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823564448] [2023-12-16 04:30:19,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:19,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:19,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:20,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:20,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:20,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:30:20,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:20,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:30:20,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:20,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:20,296 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:30:20,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:20,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823564448] [2023-12-16 04:30:20,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823564448] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:20,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:20,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-12-16 04:30:20,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102017990] [2023-12-16 04:30:20,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:20,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 04:30:20,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:20,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 04:30:20,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-12-16 04:30:20,298 INFO L87 Difference]: Start difference. First operand 486 states and 653 transitions. Second operand has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:30:21,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:21,113 INFO L93 Difference]: Finished difference Result 975 states and 1298 transitions. [2023-12-16 04:30:21,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 04:30:21,113 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 117 [2023-12-16 04:30:21,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:21,115 INFO L225 Difference]: With dead ends: 975 [2023-12-16 04:30:21,115 INFO L226 Difference]: Without dead ends: 623 [2023-12-16 04:30:21,116 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2023-12-16 04:30:21,116 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 121 mSDsluCounter, 806 mSDsCounter, 0 mSdLazyCounter, 968 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 968 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:21,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 978 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 968 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 04:30:21,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2023-12-16 04:30:21,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 319. [2023-12-16 04:30:21,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 286 states have (on average 1.2972027972027973) internal successors, (371), 288 states have internal predecessors, (371), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 04:30:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 427 transitions. [2023-12-16 04:30:21,132 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 427 transitions. Word has length 117 [2023-12-16 04:30:21,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:21,132 INFO L495 AbstractCegarLoop]: Abstraction has 319 states and 427 transitions. [2023-12-16 04:30:21,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.5) internal successors, (60), 10 states have internal predecessors, (60), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2023-12-16 04:30:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 427 transitions. [2023-12-16 04:30:21,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 04:30:21,133 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:21,133 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:21,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-12-16 04:30:21,133 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:21,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:21,133 INFO L85 PathProgramCache]: Analyzing trace with hash 100254053, now seen corresponding path program 1 times [2023-12-16 04:30:21,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:21,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176711527] [2023-12-16 04:30:21,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:21,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-16 04:30:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-16 04:30:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-16 04:30:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-16 04:30:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-16 04:30:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-16 04:30:21,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-16 04:30:21,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-16 04:30:21,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-12-16 04:30:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-12-16 04:30:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-16 04:30:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-16 04:30:21,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:30:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-12-16 04:30:21,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:30:21,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176711527] [2023-12-16 04:30:21,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176711527] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:30:21,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:30:21,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-16 04:30:21,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446729319] [2023-12-16 04:30:21,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:30:21,684 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:30:21,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:30:21,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:30:21,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:30:21,685 INFO L87 Difference]: Start difference. First operand 319 states and 427 transitions. Second operand has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:30:21,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:30:21,905 INFO L93 Difference]: Finished difference Result 503 states and 674 transitions. [2023-12-16 04:30:21,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:30:21,906 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2023-12-16 04:30:21,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:30:21,907 INFO L225 Difference]: With dead ends: 503 [2023-12-16 04:30:21,907 INFO L226 Difference]: Without dead ends: 309 [2023-12-16 04:30:21,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-12-16 04:30:21,908 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 78 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 495 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:30:21,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 495 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:30:21,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2023-12-16 04:30:21,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 307. [2023-12-16 04:30:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 274 states have (on average 1.2846715328467153) internal successors, (352), 276 states have internal predecessors, (352), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-16 04:30:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 408 transitions. [2023-12-16 04:30:21,923 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 408 transitions. Word has length 118 [2023-12-16 04:30:21,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:30:21,923 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 408 transitions. [2023-12-16 04:30:21,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.2) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2023-12-16 04:30:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 408 transitions. [2023-12-16 04:30:21,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-12-16 04:30:21,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:30:21,924 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:21,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-12-16 04:30:21,924 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:30:21,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:30:21,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1701439045, now seen corresponding path program 1 times [2023-12-16 04:30:21,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:30:21,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716560072] [2023-12-16 04:30:21,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:30:21,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:30:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:30:21,977 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:30:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:30:22,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:30:22,071 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:30:22,072 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:30:22,073 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-12-16 04:30:22,075 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:30:22,078 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:30:22,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:30:22 BoogieIcfgContainer [2023-12-16 04:30:22,146 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:30:22,146 INFO L158 Benchmark]: Toolchain (without parser) took 43624.70ms. Allocated memory was 379.6MB in the beginning and 889.2MB in the end (delta: 509.6MB). Free memory was 335.8MB in the beginning and 330.2MB in the end (delta: 5.5MB). Peak memory consumption was 516.2MB. Max. memory is 8.0GB. [2023-12-16 04:30:22,146 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:30:22,146 INFO L158 Benchmark]: CACSL2BoogieTranslator took 309.13ms. Allocated memory is still 379.6MB. Free memory was 335.8MB in the beginning and 319.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 04:30:22,146 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.47ms. Allocated memory is still 379.6MB. Free memory was 319.0MB in the beginning and 314.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 04:30:22,146 INFO L158 Benchmark]: Boogie Preprocessor took 68.11ms. Allocated memory is still 379.6MB. Free memory was 314.8MB in the beginning and 309.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 04:30:22,147 INFO L158 Benchmark]: RCFGBuilder took 492.68ms. Allocated memory is still 379.6MB. Free memory was 309.5MB in the beginning and 277.6MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. [2023-12-16 04:30:22,147 INFO L158 Benchmark]: TraceAbstraction took 42680.89ms. Allocated memory was 379.6MB in the beginning and 889.2MB in the end (delta: 509.6MB). Free memory was 276.5MB in the beginning and 330.2MB in the end (delta: -53.7MB). Peak memory consumption was 456.4MB. Max. memory is 8.0GB. [2023-12-16 04:30:22,151 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 203.4MB. Free memory is still 150.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 309.13ms. Allocated memory is still 379.6MB. Free memory was 335.8MB in the beginning and 319.0MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 69.47ms. Allocated memory is still 379.6MB. Free memory was 319.0MB in the beginning and 314.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 68.11ms. Allocated memory is still 379.6MB. Free memory was 314.8MB in the beginning and 309.5MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 492.68ms. Allocated memory is still 379.6MB. Free memory was 309.5MB in the beginning and 277.6MB in the end (delta: 32.0MB). Peak memory consumption was 32.5MB. Max. memory is 8.0GB. * TraceAbstraction took 42680.89ms. Allocated memory was 379.6MB in the beginning and 889.2MB in the end (delta: 509.6MB). Free memory was 276.5MB in the beginning and 330.2MB in the end (delta: -53.7MB). Peak memory consumption was 456.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 93, overapproximation of bitwise operation at line 104, overapproximation of someBinaryArithmeticDOUBLEoperation at line 76. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { 0, 0, 19138, 25, -50, 8.3, 255.6, 10000000.375, 0.0, 255.375, 50, 2, 1, 5 }; [L108] isInitial = 1 [L109] FCALL initially() [L110] COND TRUE 1 [L111] FCALL updateLastVariables() [L112] CALL updateVariables() [L80] WrapperStruct00.var_1_2 = __VERIFIER_nondet_uchar() [L81] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L81] CALL assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L81] RET assume_abort_if_not(WrapperStruct00.var_1_2 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L82] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L82] CALL assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L82] RET assume_abort_if_not(WrapperStruct00.var_1_2 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L83] WrapperStruct00.var_1_4 = __VERIFIER_nondet_ushort() [L84] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1] [L85] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 32767) VAL [WrapperStruct00={4:0}, isInitial=1] [L86] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L87] EXPR WrapperStruct00.var_1_9 [L87] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F [L87] EXPR WrapperStruct00.var_1_9 [L87] EXPR WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] EXPR (WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L87] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L87] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= 0.0F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L88] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L89] EXPR WrapperStruct00.var_1_10 [L89] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_10 [L89] EXPR WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] EXPR (WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= 0.0F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L90] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L91] EXPR WrapperStruct00.var_1_11 [L91] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_11 [L91] EXPR WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR (WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] EXPR (WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= 4611686.018427382800e+12F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L92] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L93] EXPR WrapperStruct00.var_1_12 [L93] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_12 [L93] EXPR WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] EXPR (WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= 0.0F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1] [L94] WrapperStruct00.var_1_14 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1] [L96] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1] [L97] WrapperStruct00.var_1_16 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1] [L99] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1] [L99] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1] [L112] RET updateVariables() [L113] CALL step() [L58] EXPR WrapperStruct00.var_1_14 [L58] WrapperStruct00.var_1_13 = WrapperStruct00.var_1_14 [L59] EXPR WrapperStruct00.var_1_16 [L59] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L60] WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L60] COND FALSE !(WrapperStruct00.var_1_2) [L63] EXPR WrapperStruct00.var_1_2 [L63] WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L63] WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L63] COND FALSE !(WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) [L66] EXPR WrapperStruct00.var_1_4 [L66] unsigned short int stepLocal_0 = WrapperStruct00.var_1_4; [L67] EXPR WrapperStruct00.var_1_13 [L67] EXPR WrapperStruct00.var_1_13 [L67] EXPR WrapperStruct00.var_1_13 [L67] EXPR WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=32767] [L67] EXPR ((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13)) [L67] EXPR WrapperStruct00.var_1_13 [L67] EXPR WrapperStruct00.var_1_13 [L67] EXPR WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13 [L67] EXPR ((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=32767] [L67] COND TRUE stepLocal_0 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13)))) [L68] EXPR WrapperStruct00.var_1_13 [L68] EXPR WrapperStruct00.var_1_13 [L68] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1] [L68] EXPR (((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4) [L68] EXPR WrapperStruct00.var_1_13 [L68] EXPR WrapperStruct00.var_1_13 [L68] EXPR (((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4) VAL [WrapperStruct00={4:0}, isInitial=1, stepLocal_0=32767] [L68] WrapperStruct00.var_1_7 = (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))) [L72] EXPR WrapperStruct00.var_1_13 [L72] unsigned char stepLocal_1 = WrapperStruct00.var_1_13; [L73] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L73] COND FALSE !(WrapperStruct00.var_1_13 < stepLocal_1) [L76] EXPR WrapperStruct00.var_1_11 [L76] EXPR WrapperStruct00.var_1_12 [L76] EXPR WrapperStruct00.var_1_9 [L76] WrapperStruct00.var_1_8 = ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_9) [L113] RET step() [L114] CALL, EXPR property() [L104] EXPR WrapperStruct00.var_1_2 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1 [L104] EXPR WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1) [L104] EXPR WrapperStruct00.var_1_2 [L104] EXPR WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1)) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1 [L104] EXPR (WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1)) && ((WrapperStruct00.var_1_4 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_13 + (WrapperStruct00.var_1_1 + WrapperStruct00.var_1_4))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1)) && ((WrapperStruct00.var_1_4 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_13 + (WrapperStruct00.var_1_1 + WrapperStruct00.var_1_4))))) [L104] EXPR WrapperStruct00.var_1_4 [L104] EXPR WrapperStruct00.var_1_13 [L104] EXPR WrapperStruct00.var_1_13 [L104] EXPR WrapperStruct00.var_1_13 [L104] EXPR WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR ((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13)) [L104] EXPR WrapperStruct00.var_1_13 [L104] EXPR WrapperStruct00.var_1_13 [L104] EXPR WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13 [L104] EXPR ((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13)) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (WrapperStruct00.var_1_4 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_13 + (WrapperStruct00.var_1_1 + WrapperStruct00.var_1_4)))) [L104] EXPR WrapperStruct00.var_1_7 [L104] EXPR WrapperStruct00.var_1_13 [L104] EXPR WrapperStruct00.var_1_1 [L104] EXPR WrapperStruct00.var_1_4 [L104] EXPR (WrapperStruct00.var_1_4 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_13 + (WrapperStruct00.var_1_1 + WrapperStruct00.var_1_4)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR ((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1)) && ((WrapperStruct00.var_1_4 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_13 + (WrapperStruct00.var_1_1 + WrapperStruct00.var_1_4))))) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1)) && ((WrapperStruct00.var_1_4 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_13 + (WrapperStruct00.var_1_1 + WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_8 == ((double) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_8 == ((double) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_9)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1)) && ((WrapperStruct00.var_1_4 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_13 + (WrapperStruct00.var_1_1 + WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_8 == ((double) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_8 == ((double) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_9)))) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1)) && ((WrapperStruct00.var_1_4 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_13 + (WrapperStruct00.var_1_1 + WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_8 == ((double) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_8 == ((double) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_9))))) && (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR ((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1)) && ((WrapperStruct00.var_1_4 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_13 + (WrapperStruct00.var_1_1 + WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_8 == ((double) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_8 == ((double) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_9))))) && (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1)) && ((WrapperStruct00.var_1_4 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_13 + (WrapperStruct00.var_1_1 + WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_8 == ((double) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_8 == ((double) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_9))))) && (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1] [L104] EXPR (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1)) && ((WrapperStruct00.var_1_4 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_13 + (WrapperStruct00.var_1_1 + WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_8 == ((double) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_8 == ((double) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_9))))) && (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) VAL [WrapperStruct00={4:0}, isInitial=1] [L104-L105] return (((((WrapperStruct00.var_1_2 ? (WrapperStruct00.var_1_1 == ((unsigned short int) ((17222 - WrapperStruct00.var_1_13) + (((((29916) < (WrapperStruct00.var_1_4)) ? (29916) : (WrapperStruct00.var_1_4))) - WrapperStruct00.var_1_13)))) : 1) && ((WrapperStruct00.var_1_2 && (WrapperStruct00.var_1_4 >= (WrapperStruct00.var_1_13 + WrapperStruct00.var_1_1))) ? (WrapperStruct00.var_1_6 == ((signed char) 8)) : 1)) && ((WrapperStruct00.var_1_4 <= ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_13 << WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_7 == ((signed long int) (((((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) < (WrapperStruct00.var_1_4)) ? ((WrapperStruct00.var_1_13 - WrapperStruct00.var_1_13)) : (WrapperStruct00.var_1_4))))) : (WrapperStruct00.var_1_7 == ((signed long int) (WrapperStruct00.var_1_13 + (WrapperStruct00.var_1_1 + WrapperStruct00.var_1_4)))))) && ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_13) ? (WrapperStruct00.var_1_8 == ((double) (WrapperStruct00.var_1_9 - WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_8 == ((double) ((WrapperStruct00.var_1_11 - WrapperStruct00.var_1_12) - WrapperStruct00.var_1_9))))) && (WrapperStruct00.var_1_13 == ((unsigned char) WrapperStruct00.var_1_14))) && (WrapperStruct00.var_1_15 == ((signed char) WrapperStruct00.var_1_16)) ; [L114] RET, EXPR property() [L114] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.6s, OverallIterations: 22, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2139 SdHoareTripleChecker+Valid, 7.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2121 mSDsluCounter, 12138 SdHoareTripleChecker+Invalid, 6.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 9230 mSDsCounter, 131 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8140 IncrementalHoareTripleChecker+Invalid, 8271 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 131 mSolverCounterUnsat, 2908 mSDtfsCounter, 8140 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 850 GetRequests, 684 SyntacticMatches, 3 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=500occurred in iteration=18, InterpolantAutomatonStates: 182, 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, 21 MinimizatonAttempts, 1471 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 30.8s InterpolantComputationTime, 2506 NumberOfCodeBlocks, 2506 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 2367 ConstructedInterpolants, 0 QuantifiedInterpolants, 11738 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 5544/5544 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:30:22,179 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...