/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 21:40:20,313 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 21:40:20,374 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-15 21:40:20,377 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 21:40:20,377 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 21:40:20,405 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 21:40:20,405 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 21:40:20,405 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 21:40:20,406 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 21:40:20,406 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 21:40:20,406 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 21:40:20,406 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 21:40:20,407 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 21:40:20,407 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 21:40:20,407 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 21:40:20,407 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 21:40:20,408 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 21:40:20,408 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 21:40:20,408 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 21:40:20,408 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 21:40:20,409 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 21:40:20,411 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 21:40:20,411 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 21:40:20,411 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 21:40:20,414 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 21:40:20,414 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 21:40:20,414 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 21:40:20,415 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 21:40:20,415 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 21:40:20,415 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 21:40:20,416 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 21:40:20,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 21:40:20,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:40:20,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 21:40:20,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 21:40:20,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 21:40:20,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 21:40:20,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 21:40:20,417 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 21:40:20,417 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 21:40:20,417 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 21:40:20,417 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 21:40:20,417 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 21:40:20,417 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-15 21:40:20,599 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 21:40:20,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 21:40:20,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 21:40:20,618 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 21:40:20,619 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 21:40:20,619 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-41.i [2023-12-15 21:40:21,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 21:40:21,930 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 21:40:21,931 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-41.i [2023-12-15 21:40:21,936 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b83e3053/efbc18a31e454ca193e0aae336ce209d/FLAGb1a2c1946 [2023-12-15 21:40:21,946 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b83e3053/efbc18a31e454ca193e0aae336ce209d [2023-12-15 21:40:21,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 21:40:21,948 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 21:40:21,949 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 21:40:21,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 21:40:21,952 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 21:40:21,952 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:40:21" (1/1) ... [2023-12-15 21:40:21,953 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ed83670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:21, skipping insertion in model container [2023-12-15 21:40:21,953 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 09:40:21" (1/1) ... [2023-12-15 21:40:21,971 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 21:40:22,092 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-41.i[916,929] [2023-12-15 21:40:22,122 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:40:22,137 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 21:40:22,148 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-41.i[916,929] [2023-12-15 21:40:22,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 21:40:22,216 INFO L206 MainTranslator]: Completed translation [2023-12-15 21:40:22,217 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22 WrapperNode [2023-12-15 21:40:22,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 21:40:22,222 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 21:40:22,222 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 21:40:22,222 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 21:40:22,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (1/1) ... [2023-12-15 21:40:22,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (1/1) ... [2023-12-15 21:40:22,297 INFO L138 Inliner]: procedures = 29, calls = 137, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 396 [2023-12-15 21:40:22,298 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 21:40:22,298 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 21:40:22,298 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 21:40:22,298 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 21:40:22,305 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (1/1) ... [2023-12-15 21:40:22,306 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (1/1) ... [2023-12-15 21:40:22,309 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (1/1) ... [2023-12-15 21:40:22,319 INFO L175 MemorySlicer]: Split 111 memory accesses to 2 slices as follows [2, 109]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 17 writes are split as follows [0, 17]. [2023-12-15 21:40:22,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (1/1) ... [2023-12-15 21:40:22,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (1/1) ... [2023-12-15 21:40:22,330 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (1/1) ... [2023-12-15 21:40:22,332 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (1/1) ... [2023-12-15 21:40:22,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (1/1) ... [2023-12-15 21:40:22,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (1/1) ... [2023-12-15 21:40:22,338 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 21:40:22,338 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 21:40:22,339 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 21:40:22,339 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 21:40:22,339 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (1/1) ... [2023-12-15 21:40:22,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 21:40:22,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 21:40:22,365 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-15 21:40:22,423 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-15 21:40:22,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 21:40:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-15 21:40:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-15 21:40:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-15 21:40:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-15 21:40:22,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-15 21:40:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-15 21:40:22,430 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-15 21:40:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-15 21:40:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-15 21:40:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-15 21:40:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-15 21:40:22,431 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-15 21:40:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 21:40:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-15 21:40:22,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 21:40:22,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 21:40:22,543 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 21:40:22,544 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 21:40:22,802 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 21:40:22,820 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 21:40:22,820 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 21:40:22,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:40:22 BoogieIcfgContainer [2023-12-15 21:40:22,820 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 21:40:22,822 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 21:40:22,822 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 21:40:22,824 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 21:40:22,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 09:40:21" (1/3) ... [2023-12-15 21:40:22,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75efcf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:40:22, skipping insertion in model container [2023-12-15 21:40:22,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 09:40:22" (2/3) ... [2023-12-15 21:40:22,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75efcf6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 09:40:22, skipping insertion in model container [2023-12-15 21:40:22,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 09:40:22" (3/3) ... [2023-12-15 21:40:22,825 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-41.i [2023-12-15 21:40:22,836 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 21:40:22,836 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 21:40:22,869 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 21:40:22,874 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;@8a762e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 21:40:22,874 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 21:40:22,878 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 66 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:40:22,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 21:40:22,889 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:22,890 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:40:22,893 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:22,896 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:22,897 INFO L85 PathProgramCache]: Analyzing trace with hash -689926641, now seen corresponding path program 1 times [2023-12-15 21:40:22,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:22,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120873213] [2023-12-15 21:40:22,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:22,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:40:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:40:23,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:40:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:40:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:40:23,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:40:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:40:23,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:40:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:40:23,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:40:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:40:23,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:40:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:40:23,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:40:23,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,135 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:40:23,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:23,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120873213] [2023-12-15 21:40:23,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120873213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:23,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:23,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-15 21:40:23,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925201773] [2023-12-15 21:40:23,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:23,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-15 21:40:23,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:23,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-15 21:40:23,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-15 21:40:23,161 INFO L87 Difference]: Start difference. First operand has 82 states, 65 states have (on average 1.4461538461538461) internal successors, (94), 66 states have internal predecessors, (94), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:40:23,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:23,202 INFO L93 Difference]: Finished difference Result 157 states and 250 transitions. [2023-12-15 21:40:23,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-15 21:40:23,204 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 109 [2023-12-15 21:40:23,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:23,210 INFO L225 Difference]: With dead ends: 157 [2023-12-15 21:40:23,210 INFO L226 Difference]: Without dead ends: 76 [2023-12-15 21:40:23,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-15 21:40:23,217 INFO L413 NwaCegarLoop]: 106 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, 106 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-15 21:40:23,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 106 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:40:23,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2023-12-15 21:40:23,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2023-12-15 21:40:23,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 60 states have (on average 1.3666666666666667) internal successors, (82), 60 states have internal predecessors, (82), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:40:23,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2023-12-15 21:40:23,245 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 110 transitions. Word has length 109 [2023-12-15 21:40:23,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:23,245 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 110 transitions. [2023-12-15 21:40:23,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2023-12-15 21:40:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 110 transitions. [2023-12-15 21:40:23,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 21:40:23,247 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:23,248 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:40:23,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-15 21:40:23,248 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:23,248 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:23,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1313593619, now seen corresponding path program 1 times [2023-12-15 21:40:23,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:23,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186469959] [2023-12-15 21:40:23,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:23,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:23,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:40:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:40:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:40:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:40:23,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:40:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:40:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:40:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:40:23,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:40:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:40:23,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:40:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:40:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:40:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:40:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:40:23,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:23,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186469959] [2023-12-15 21:40:23,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186469959] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:23,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:23,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-15 21:40:23,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850470252] [2023-12-15 21:40:23,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:23,505 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-15 21:40:23,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-15 21:40:23,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-15 21:40:23,506 INFO L87 Difference]: Start difference. First operand 76 states and 110 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:40:23,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:23,568 INFO L93 Difference]: Finished difference Result 173 states and 252 transitions. [2023-12-15 21:40:23,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-15 21:40:23,569 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2023-12-15 21:40:23,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:23,571 INFO L225 Difference]: With dead ends: 173 [2023-12-15 21:40:23,571 INFO L226 Difference]: Without dead ends: 98 [2023-12-15 21:40:23,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-15 21:40:23,572 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 45 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 317 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-15 21:40:23,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 317 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:40:23,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-12-15 21:40:23,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 78. [2023-12-15 21:40:23,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.3548387096774193) internal successors, (84), 62 states have internal predecessors, (84), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-15 21:40:23,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 112 transitions. [2023-12-15 21:40:23,586 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 112 transitions. Word has length 109 [2023-12-15 21:40:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:23,587 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 112 transitions. [2023-12-15 21:40:23,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:40:23,587 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 112 transitions. [2023-12-15 21:40:23,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-15 21:40:23,588 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:23,588 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:40:23,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-15 21:40:23,589 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:23,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:23,589 INFO L85 PathProgramCache]: Analyzing trace with hash 504246993, now seen corresponding path program 1 times [2023-12-15 21:40:23,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:23,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044695248] [2023-12-15 21:40:23,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:23,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:40:23,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:40:23,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:40:23,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:40:23,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:40:23,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:40:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:40:23,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:40:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:40:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:40:23,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:40:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:40:23,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:40:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:40:23,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:23,970 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:40:23,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:23,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044695248] [2023-12-15 21:40:23,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044695248] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:23,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:23,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 21:40:23,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140140070] [2023-12-15 21:40:23,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:23,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-15 21:40:23,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:23,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-15 21:40:23,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-15 21:40:23,977 INFO L87 Difference]: Start difference. First operand 78 states and 112 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:40:24,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:24,103 INFO L93 Difference]: Finished difference Result 189 states and 268 transitions. [2023-12-15 21:40:24,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 21:40:24,103 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 109 [2023-12-15 21:40:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:24,107 INFO L225 Difference]: With dead ends: 189 [2023-12-15 21:40:24,107 INFO L226 Difference]: Without dead ends: 112 [2023-12-15 21:40:24,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 30 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-15 21:40:24,111 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 83 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:24,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 399 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 21:40:24,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-15 21:40:24,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2023-12-15 21:40:24,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 90 states have (on average 1.3555555555555556) internal successors, (122), 91 states have internal predecessors, (122), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 21:40:24,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 154 transitions. [2023-12-15 21:40:24,130 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 154 transitions. Word has length 109 [2023-12-15 21:40:24,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:24,131 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 154 transitions. [2023-12-15 21:40:24,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 5 states have internal predecessors, (42), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:40:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 154 transitions. [2023-12-15 21:40:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-12-15 21:40:24,134 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:24,134 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:40:24,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-15 21:40:24,134 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:24,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:24,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1581507689, now seen corresponding path program 1 times [2023-12-15 21:40:24,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:24,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496327857] [2023-12-15 21:40:24,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:24,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:24,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-15 21:40:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-15 21:40:24,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-15 21:40:24,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-12-15 21:40:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-15 21:40:24,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-15 21:40:24,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-15 21:40:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-12-15 21:40:24,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-15 21:40:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-15 21:40:24,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-15 21:40:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-15 21:40:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-15 21:40:24,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-12-15 21:40:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 21:40:24,339 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-12-15 21:40:24,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 21:40:24,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496327857] [2023-12-15 21:40:24,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496327857] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 21:40:24,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 21:40:24,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-15 21:40:24,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586485914] [2023-12-15 21:40:24,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 21:40:24,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-15 21:40:24,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 21:40:24,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-15 21:40:24,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-15 21:40:24,341 INFO L87 Difference]: Start difference. First operand 109 states and 154 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:40:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 21:40:24,354 INFO L93 Difference]: Finished difference Result 189 states and 266 transitions. [2023-12-15 21:40:24,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-15 21:40:24,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2023-12-15 21:40:24,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 21:40:24,357 INFO L225 Difference]: With dead ends: 189 [2023-12-15 21:40:24,357 INFO L226 Difference]: Without dead ends: 81 [2023-12-15 21:40:24,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-15 21:40:24,365 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 1 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 21:40:24,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 194 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 21:40:24,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-12-15 21:40:24,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-12-15 21:40:24,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 63 states have internal predecessors, (80), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-15 21:40:24,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 112 transitions. [2023-12-15 21:40:24,377 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 112 transitions. Word has length 110 [2023-12-15 21:40:24,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 21:40:24,377 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 112 transitions. [2023-12-15 21:40:24,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2023-12-15 21:40:24,377 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 112 transitions. [2023-12-15 21:40:24,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2023-12-15 21:40:24,382 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 21:40:24,382 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-15 21:40:24,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-15 21:40:24,383 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 21:40:24,383 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 21:40:24,383 INFO L85 PathProgramCache]: Analyzing trace with hash 604054712, now seen corresponding path program 1 times [2023-12-15 21:40:24,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 21:40:24,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867242715] [2023-12-15 21:40:24,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 21:40:24,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 21:40:24,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:40:24,470 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 21:40:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 21:40:24,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 21:40:24,569 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 21:40:24,569 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 21:40:24,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-15 21:40:24,573 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-15 21:40:24,575 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 21:40:24,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 09:40:24 BoogieIcfgContainer [2023-12-15 21:40:24,623 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 21:40:24,624 INFO L158 Benchmark]: Toolchain (without parser) took 2675.58ms. Allocated memory was 190.8MB in the beginning and 255.9MB in the end (delta: 65.0MB). Free memory was 142.1MB in the beginning and 166.4MB in the end (delta: -24.3MB). Peak memory consumption was 42.0MB. Max. memory is 8.0GB. [2023-12-15 21:40:24,624 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 190.8MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 21:40:24,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 272.89ms. Allocated memory is still 190.8MB. Free memory was 142.1MB in the beginning and 126.1MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. [2023-12-15 21:40:24,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.46ms. Allocated memory is still 190.8MB. Free memory was 126.1MB in the beginning and 122.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:40:24,624 INFO L158 Benchmark]: Boogie Preprocessor took 39.79ms. Allocated memory is still 190.8MB. Free memory was 122.6MB in the beginning and 118.0MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-15 21:40:24,624 INFO L158 Benchmark]: RCFGBuilder took 481.89ms. Allocated memory is still 190.8MB. Free memory was 118.0MB in the beginning and 148.6MB in the end (delta: -30.5MB). Peak memory consumption was 21.5MB. Max. memory is 8.0GB. [2023-12-15 21:40:24,625 INFO L158 Benchmark]: TraceAbstraction took 1801.60ms. Allocated memory was 190.8MB in the beginning and 255.9MB in the end (delta: 65.0MB). Free memory was 148.0MB in the beginning and 166.4MB in the end (delta: -18.4MB). Peak memory consumption was 46.7MB. Max. memory is 8.0GB. [2023-12-15 21:40:24,625 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.39ms. Allocated memory is still 190.8MB. Free memory is still 145.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 272.89ms. Allocated memory is still 190.8MB. Free memory was 142.1MB in the beginning and 126.1MB in the end (delta: 16.1MB). Peak memory consumption was 15.7MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 75.46ms. Allocated memory is still 190.8MB. Free memory was 126.1MB in the beginning and 122.6MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.79ms. Allocated memory is still 190.8MB. Free memory was 122.6MB in the beginning and 118.0MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 481.89ms. Allocated memory is still 190.8MB. Free memory was 118.0MB in the beginning and 148.6MB in the end (delta: -30.5MB). Peak memory consumption was 21.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1801.60ms. Allocated memory was 190.8MB in the beginning and 255.9MB in the end (delta: 65.0MB). Free memory was 148.0MB in the beginning and 166.4MB in the end (delta: -18.4MB). Peak memory consumption was 46.7MB. 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 112, overapproximation of someBinaryArithmeticDOUBLEoperation at line 58. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { -16, 0, -8, 5, 2, 0, 8.5, 999999999999.6, 10, -1, 16, 64 }; [L51] signed char last_1_WrapperStruct00_var_1_1 = -16; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] EXPR WrapperStruct00.var_1_1 [L109] last_1_WrapperStruct00_var_1_1 = WrapperStruct00.var_1_1 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L86] WrapperStruct00.var_1_5 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_5 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L88] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_5 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L89] WrapperStruct00.var_1_6 = __VERIFIER_nondet_char() [L90] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= -31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= -31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L91] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 31) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L92] WrapperStruct00.var_1_7 = __VERIFIER_nondet_char() [L93] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L95] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L97] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L98] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_13 [L99] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_13 [L99] EXPR WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] EXPR (WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= 0.0F && WrapperStruct00.var_1_13 <= -1.0e-20F) || (WrapperStruct00.var_1_13 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_13 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L100] WrapperStruct00.var_1_15 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -128) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -128) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L102] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] CALL assume_abort_if_not(WrapperStruct00.var_1_15 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L103] RET assume_abort_if_not(WrapperStruct00.var_1_15 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L104] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L120] RET updateVariables() [L121] CALL step() [L55] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L55] COND TRUE WrapperStruct00.var_1_5 && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1) [L56] EXPR WrapperStruct00.var_1_17 [L56] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_17 [L58] EXPR WrapperStruct00.var_1_13 [L58] WrapperStruct00.var_1_12 = (WrapperStruct00.var_1_13 - 8.3) [L59] EXPR WrapperStruct00.var_1_13 [L59] EXPR WrapperStruct00.var_1_12 [L59] unsigned char stepLocal_1 = WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12; [L60] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L60] COND TRUE WrapperStruct00.var_1_5 && stepLocal_1 [L61] EXPR WrapperStruct00.var_1_16 [L61] WrapperStruct00.var_1_14 = WrapperStruct00.var_1_16 [L65] WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L65] COND TRUE WrapperStruct00.var_1_5 [L66] EXPR WrapperStruct00.var_1_16 [L66] EXPR WrapperStruct00.var_1_16 [L66] WrapperStruct00.var_1_8 = (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16) [L74] EXPR WrapperStruct00.var_1_8 [L74] EXPR WrapperStruct00.var_1_16 [L74] unsigned long int stepLocal_0 = (WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16; [L75] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L75] COND FALSE !(stepLocal_0 > WrapperStruct00.var_1_8) [L82] EXPR WrapperStruct00.var_1_6 [L82] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_6 [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR WrapperStruct00.var_1_8 [L112] EXPR WrapperStruct00.var_1_16 [L112] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR (((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6)) [L112] EXPR WrapperStruct00.var_1_1 [L112] EXPR WrapperStruct00.var_1_6 [L112] EXPR (((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR ((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR ((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)))) [L112] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))) [L112] EXPR WrapperStruct00.var_1_8 [L112] EXPR WrapperStruct00.var_1_16 [L112] EXPR WrapperStruct00.var_1_16 [L112] EXPR WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR ((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR (((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR (((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3))) [L112] EXPR WrapperStruct00.var_1_12 [L112] EXPR WrapperStruct00.var_1_13 [L112] EXPR (((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR ((((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))) && ((WrapperStruct00.var_1_5 && (WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR ((((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))) && ((WrapperStruct00.var_1_5 && (WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_15))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR (((((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))) && ((WrapperStruct00.var_1_5 && (WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_15)))) && ((WrapperStruct00.var_1_5 && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_17)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112] EXPR (((((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))) && ((WrapperStruct00.var_1_5 && (WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_15)))) && ((WrapperStruct00.var_1_5 && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_17)) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L112-L113] return (((((((WrapperStruct00.var_1_8 & 0u) * WrapperStruct00.var_1_16) > WrapperStruct00.var_1_8) ? (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_1 == ((signed char) ((16 + WrapperStruct00.var_1_6) + WrapperStruct00.var_1_7))) : (WrapperStruct00.var_1_1 == ((signed char) ((((WrapperStruct00.var_1_6) < 0 ) ? -(WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_6)))))) : (WrapperStruct00.var_1_1 == ((signed char) WrapperStruct00.var_1_6))) && (WrapperStruct00.var_1_5 ? (WrapperStruct00.var_1_8 == ((unsigned short int) (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_16))) : (((WrapperStruct00.var_1_16 > WrapperStruct00.var_1_14) || WrapperStruct00.var_1_11) ? (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_8 == ((unsigned short int) WrapperStruct00.var_1_16))))) && (WrapperStruct00.var_1_12 == ((double) (WrapperStruct00.var_1_13 - 8.3)))) && ((WrapperStruct00.var_1_5 && (WrapperStruct00.var_1_13 >= WrapperStruct00.var_1_12)) ? (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((signed long int) WrapperStruct00.var_1_15)))) && ((WrapperStruct00.var_1_5 && (last_1_WrapperStruct00_var_1_1 <= last_1_WrapperStruct00_var_1_1)) ? (WrapperStruct00.var_1_16 == ((unsigned char) WrapperStruct00.var_1_17)) : 1) ; [L122] RET, EXPR property() [L122] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_1=-16] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 82 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 129 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 129 mSDsluCounter, 1016 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 592 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 149 IncrementalHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 424 mSDtfsCounter, 149 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 143 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=3, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 548 NumberOfCodeBlocks, 548 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 433 ConstructedInterpolants, 0 QuantifiedInterpolants, 464 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 1456/1456 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-15 21:40:24,638 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...