/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-36.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 15:46:18,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 15:46:19,020 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 15:46:19,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 15:46:19,023 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 15:46:19,049 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 15:46:19,049 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 15:46:19,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 15:46:19,050 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 15:46:19,053 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 15:46:19,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 15:46:19,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 15:46:19,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 15:46:19,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 15:46:19,055 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 15:46:19,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 15:46:19,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 15:46:19,056 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 15:46:19,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 15:46:19,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 15:46:19,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 15:46:19,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 15:46:19,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 15:46:19,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 15:46:19,057 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 15:46:19,057 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 15:46:19,057 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 15:46:19,057 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 15:46:19,057 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 15:46:19,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 15:46:19,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 15:46:19,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 15:46:19,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:46:19,059 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 15:46:19,059 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 15:46:19,059 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 15:46:19,059 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 15:46:19,059 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 15:46:19,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 15:46:19,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 15:46:19,059 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 15:46:19,060 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 15:46:19,060 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 15:46:19,060 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 15:46:19,219 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 15:46:19,233 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 15:46:19,235 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 15:46:19,236 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 15:46:19,236 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 15:46:19,237 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-36.i [2023-12-19 15:46:20,193 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 15:46:20,360 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 15:46:20,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-36.i [2023-12-19 15:46:20,366 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b041b6e11/066fb371a6234fc2a63b64af7d11e14a/FLAG336f92297 [2023-12-19 15:46:20,375 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b041b6e11/066fb371a6234fc2a63b64af7d11e14a [2023-12-19 15:46:20,377 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 15:46:20,378 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 15:46:20,379 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 15:46:20,379 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 15:46:20,383 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 15:46:20,384 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,385 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b1e5135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20, skipping insertion in model container [2023-12-19 15:46:20,385 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,406 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 15:46:20,507 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-36.i[916,929] [2023-12-19 15:46:20,562 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:46:20,570 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 15:46:20,578 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-36.i[916,929] [2023-12-19 15:46:20,616 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 15:46:20,634 INFO L206 MainTranslator]: Completed translation [2023-12-19 15:46:20,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20 WrapperNode [2023-12-19 15:46:20,635 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 15:46:20,637 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 15:46:20,637 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 15:46:20,637 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 15:46:20,641 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,696 INFO L138 Inliner]: procedures = 29, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 546 [2023-12-19 15:46:20,696 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 15:46:20,697 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 15:46:20,697 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 15:46:20,697 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 15:46:20,710 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,710 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,714 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,732 INFO L175 MemorySlicer]: Split 133 memory accesses to 2 slices as follows [2, 131]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 18 writes are split as follows [0, 18]. [2023-12-19 15:46:20,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,753 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,756 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,759 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,763 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 15:46:20,763 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 15:46:20,763 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 15:46:20,763 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 15:46:20,764 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (1/1) ... [2023-12-19 15:46:20,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 15:46:20,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 15:46:20,800 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 15:46:20,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 15:46:20,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 15:46:20,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-12-19 15:46:20,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-12-19 15:46:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-12-19 15:46:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-12-19 15:46:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-12-19 15:46:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-12-19 15:46:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-12-19 15:46:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-12-19 15:46:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-12-19 15:46:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-12-19 15:46:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 15:46:20,842 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 15:46:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 15:46:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-12-19 15:46:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 15:46:20,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 15:46:20,947 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 15:46:20,949 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 15:46:21,335 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 15:46:21,377 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 15:46:21,377 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 15:46:21,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:46:21 BoogieIcfgContainer [2023-12-19 15:46:21,378 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 15:46:21,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 15:46:21,379 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 15:46:21,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 15:46:21,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:46:20" (1/3) ... [2023-12-19 15:46:21,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d09e2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:46:21, skipping insertion in model container [2023-12-19 15:46:21,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:46:20" (2/3) ... [2023-12-19 15:46:21,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d09e2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:46:21, skipping insertion in model container [2023-12-19 15:46:21,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:46:21" (3/3) ... [2023-12-19 15:46:21,387 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-36.i [2023-12-19 15:46:21,400 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 15:46:21,400 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 15:46:21,449 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 15:46:21,454 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;@5f20f5e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 15:46:21,454 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 15:46:21,463 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 100 states have (on average 1.53) internal successors, (153), 101 states have internal predecessors, (153), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-19 15:46:21,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 15:46:21,480 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:21,481 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:21,482 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:21,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:21,488 INFO L85 PathProgramCache]: Analyzing trace with hash 177960246, now seen corresponding path program 1 times [2023-12-19 15:46:21,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:21,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735445213] [2023-12-19 15:46:21,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:21,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:21,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-19 15:46:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-19 15:46:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:46:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:21,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:21,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:46:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:46:21,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:46:21,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:21,778 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-19 15:46:21,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:21,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735445213] [2023-12-19 15:46:21,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [735445213] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:21,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:21,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 15:46:21,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127706831] [2023-12-19 15:46:21,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:21,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 15:46:21,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:21,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 15:46:21,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:46:21,820 INFO L87 Difference]: Start difference. First operand has 114 states, 100 states have (on average 1.53) internal successors, (153), 101 states have internal predecessors, (153), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-19 15:46:21,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:21,888 INFO L93 Difference]: Finished difference Result 225 states and 359 transitions. [2023-12-19 15:46:21,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 15:46:21,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2023-12-19 15:46:21,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:21,904 INFO L225 Difference]: With dead ends: 225 [2023-12-19 15:46:21,904 INFO L226 Difference]: Without dead ends: 112 [2023-12-19 15:46:21,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 15:46:21,911 INFO L413 NwaCegarLoop]: 166 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, 166 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:21,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:46:21,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-12-19 15:46:21,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-12-19 15:46:21,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 99 states have (on average 1.494949494949495) internal successors, (148), 99 states have internal predecessors, (148), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-19 15:46:21,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2023-12-19 15:46:21,960 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 104 [2023-12-19 15:46:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:21,961 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2023-12-19 15:46:21,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-19 15:46:21,962 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2023-12-19 15:46:21,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 15:46:21,969 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:21,969 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:21,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 15:46:21,969 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:21,970 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:21,970 INFO L85 PathProgramCache]: Analyzing trace with hash 2013430972, now seen corresponding path program 1 times [2023-12-19 15:46:21,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:21,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275698074] [2023-12-19 15:46:21,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:21,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:22,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-19 15:46:22,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-19 15:46:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:46:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:22,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:46:22,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:46:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:46:22,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-19 15:46:22,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:22,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275698074] [2023-12-19 15:46:22,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275698074] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:22,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:22,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:46:22,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506425398] [2023-12-19 15:46:22,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:22,298 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:46:22,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:22,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:46:22,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:46:22,302 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-19 15:46:22,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:22,363 INFO L93 Difference]: Finished difference Result 229 states and 348 transitions. [2023-12-19 15:46:22,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:46:22,367 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 104 [2023-12-19 15:46:22,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:22,370 INFO L225 Difference]: With dead ends: 229 [2023-12-19 15:46:22,370 INFO L226 Difference]: Without dead ends: 118 [2023-12-19 15:46:22,371 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-19 15:46:22,371 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 10 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:22,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 490 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:46:22,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-19 15:46:22,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 114. [2023-12-19 15:46:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 101 states have (on average 1.4851485148514851) internal successors, (150), 101 states have internal predecessors, (150), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-19 15:46:22,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 172 transitions. [2023-12-19 15:46:22,379 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 172 transitions. Word has length 104 [2023-12-19 15:46:22,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:22,380 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 172 transitions. [2023-12-19 15:46:22,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-19 15:46:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 172 transitions. [2023-12-19 15:46:22,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 15:46:22,381 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:22,381 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:22,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 15:46:22,381 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:22,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:22,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1811607038, now seen corresponding path program 1 times [2023-12-19 15:46:22,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:22,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879725798] [2023-12-19 15:46:22,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:22,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-19 15:46:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-19 15:46:23,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:46:23,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:23,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:46:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:46:23,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:46:23,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:23,320 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-19 15:46:23,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:23,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879725798] [2023-12-19 15:46:23,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879725798] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:23,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:23,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:46:23,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010832142] [2023-12-19 15:46:23,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:23,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:46:23,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:23,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:46:23,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:46:23,325 INFO L87 Difference]: Start difference. First operand 114 states and 172 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-19 15:46:23,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:23,562 INFO L93 Difference]: Finished difference Result 341 states and 516 transitions. [2023-12-19 15:46:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:46:23,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2023-12-19 15:46:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:23,566 INFO L225 Difference]: With dead ends: 341 [2023-12-19 15:46:23,566 INFO L226 Difference]: Without dead ends: 228 [2023-12-19 15:46:23,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 33 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-19 15:46:23,572 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 117 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:23,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 250 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:46:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2023-12-19 15:46:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 224. [2023-12-19 15:46:23,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 199 states have (on average 1.4874371859296482) internal successors, (296), 199 states have internal predecessors, (296), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-19 15:46:23,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 340 transitions. [2023-12-19 15:46:23,604 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 340 transitions. Word has length 104 [2023-12-19 15:46:23,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:23,604 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 340 transitions. [2023-12-19 15:46:23,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-19 15:46:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 340 transitions. [2023-12-19 15:46:23,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 15:46:23,605 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:23,605 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:23,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 15:46:23,606 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:23,606 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:23,606 INFO L85 PathProgramCache]: Analyzing trace with hash 800489788, now seen corresponding path program 1 times [2023-12-19 15:46:23,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:23,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254813873] [2023-12-19 15:46:23,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:23,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-19 15:46:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-19 15:46:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:46:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:46:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:46:24,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:24,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:46:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-19 15:46:24,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:24,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254813873] [2023-12-19 15:46:24,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254813873] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:24,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:24,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:46:24,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657789839] [2023-12-19 15:46:24,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:24,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:46:24,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:24,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:46:24,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:46:24,304 INFO L87 Difference]: Start difference. First operand 224 states and 340 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-19 15:46:24,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:24,541 INFO L93 Difference]: Finished difference Result 500 states and 759 transitions. [2023-12-19 15:46:24,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 15:46:24,541 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2023-12-19 15:46:24,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:24,543 INFO L225 Difference]: With dead ends: 500 [2023-12-19 15:46:24,543 INFO L226 Difference]: Without dead ends: 277 [2023-12-19 15:46:24,543 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-19 15:46:24,544 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 206 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:24,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 287 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 287 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 15:46:24,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2023-12-19 15:46:24,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 225. [2023-12-19 15:46:24,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 200 states have (on average 1.485) internal successors, (297), 200 states have internal predecessors, (297), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-19 15:46:24,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 341 transitions. [2023-12-19 15:46:24,559 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 341 transitions. Word has length 104 [2023-12-19 15:46:24,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:24,560 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 341 transitions. [2023-12-19 15:46:24,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-19 15:46:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 341 transitions. [2023-12-19 15:46:24,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 15:46:24,562 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:24,562 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:24,562 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 15:46:24,562 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:24,562 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:24,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1501554366, now seen corresponding path program 1 times [2023-12-19 15:46:24,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:24,563 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861545063] [2023-12-19 15:46:24,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:24,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:24,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-19 15:46:24,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-19 15:46:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:46:24,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:24,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:24,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:46:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:46:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:24,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:46:24,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:24,706 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-19 15:46:24,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:24,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861545063] [2023-12-19 15:46:24,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861545063] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:24,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:24,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 15:46:24,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590026692] [2023-12-19 15:46:24,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:24,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 15:46:24,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:24,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 15:46:24,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 15:46:24,708 INFO L87 Difference]: Start difference. First operand 225 states and 341 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-19 15:46:24,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:24,864 INFO L93 Difference]: Finished difference Result 619 states and 940 transitions. [2023-12-19 15:46:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 15:46:24,865 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2023-12-19 15:46:24,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:24,867 INFO L225 Difference]: With dead ends: 619 [2023-12-19 15:46:24,867 INFO L226 Difference]: Without dead ends: 395 [2023-12-19 15:46:24,867 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 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-19 15:46:24,868 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 174 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:24,868 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 367 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 15:46:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2023-12-19 15:46:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 345. [2023-12-19 15:46:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 308 states have (on average 1.4870129870129871) internal successors, (458), 308 states have internal predecessors, (458), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-19 15:46:24,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 524 transitions. [2023-12-19 15:46:24,880 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 524 transitions. Word has length 104 [2023-12-19 15:46:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:24,880 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 524 transitions. [2023-12-19 15:46:24,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-19 15:46:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 524 transitions. [2023-12-19 15:46:24,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-19 15:46:24,881 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:24,881 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:24,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 15:46:24,881 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:24,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:24,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1924256192, now seen corresponding path program 1 times [2023-12-19 15:46:24,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:24,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840940740] [2023-12-19 15:46:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:24,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-19 15:46:25,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-19 15:46:25,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:46:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:25,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:25,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:25,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:46:25,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:46:25,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:25,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:46:25,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-19 15:46:25,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840940740] [2023-12-19 15:46:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840940740] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:25,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:25,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-19 15:46:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728336845] [2023-12-19 15:46:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:25,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-19 15:46:25,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:25,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-19 15:46:25,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-12-19 15:46:25,259 INFO L87 Difference]: Start difference. First operand 345 states and 524 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-19 15:46:25,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:25,746 INFO L93 Difference]: Finished difference Result 1150 states and 1747 transitions. [2023-12-19 15:46:25,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 15:46:25,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 104 [2023-12-19 15:46:25,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:25,751 INFO L225 Difference]: With dead ends: 1150 [2023-12-19 15:46:25,751 INFO L226 Difference]: Without dead ends: 926 [2023-12-19 15:46:25,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2023-12-19 15:46:25,754 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 492 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 776 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:25,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 776 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-19 15:46:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2023-12-19 15:46:25,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 423. [2023-12-19 15:46:25,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 386 states have (on average 1.5025906735751295) internal successors, (580), 386 states have internal predecessors, (580), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-19 15:46:25,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 646 transitions. [2023-12-19 15:46:25,781 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 646 transitions. Word has length 104 [2023-12-19 15:46:25,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:25,782 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 646 transitions. [2023-12-19 15:46:25,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-19 15:46:25,782 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 646 transitions. [2023-12-19 15:46:25,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2023-12-19 15:46:25,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:25,784 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:25,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 15:46:25,784 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:25,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:25,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1802165912, now seen corresponding path program 1 times [2023-12-19 15:46:25,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:25,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294042756] [2023-12-19 15:46:25,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:25,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:25,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-19 15:46:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-19 15:46:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:46:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:26,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:26,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:26,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:46:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:46:26,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:26,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:46:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,332 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-19 15:46:26,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:26,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294042756] [2023-12-19 15:46:26,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294042756] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:26,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:26,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 15:46:26,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915544410] [2023-12-19 15:46:26,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:26,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 15:46:26,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:26,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 15:46:26,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-19 15:46:26,334 INFO L87 Difference]: Start difference. First operand 423 states and 646 transitions. Second operand has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-19 15:46:26,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:26,823 INFO L93 Difference]: Finished difference Result 960 states and 1459 transitions. [2023-12-19 15:46:26,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 15:46:26,823 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 106 [2023-12-19 15:46:26,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:26,827 INFO L225 Difference]: With dead ends: 960 [2023-12-19 15:46:26,827 INFO L226 Difference]: Without dead ends: 697 [2023-12-19 15:46:26,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2023-12-19 15:46:26,829 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 231 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:26,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 670 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 15:46:26,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2023-12-19 15:46:26,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 365. [2023-12-19 15:46:26,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 328 states have (on average 1.4817073170731707) internal successors, (486), 328 states have internal predecessors, (486), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-19 15:46:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 552 transitions. [2023-12-19 15:46:26,847 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 552 transitions. Word has length 106 [2023-12-19 15:46:26,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:26,847 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 552 transitions. [2023-12-19 15:46:26,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.714285714285714) internal successors, (54), 8 states have internal predecessors, (54), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2023-12-19 15:46:26,848 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 552 transitions. [2023-12-19 15:46:26,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-12-19 15:46:26,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:26,848 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:26,848 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 15:46:26,849 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:26,849 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:26,849 INFO L85 PathProgramCache]: Analyzing trace with hash 390126803, now seen corresponding path program 1 times [2023-12-19 15:46:26,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:26,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115904281] [2023-12-19 15:46:26,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:26,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:26,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-12-19 15:46:26,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-12-19 15:46:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-12-19 15:46:26,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-12-19 15:46:26,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-12-19 15:46:26,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-12-19 15:46:26,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 15:46:26,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-12-19 15:46:26,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 15:46:26,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 15:46:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-12-19 15:46:26,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 15:46:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2023-12-19 15:46:26,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 15:46:26,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115904281] [2023-12-19 15:46:26,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115904281] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 15:46:26,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 15:46:26,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 15:46:26,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805571470] [2023-12-19 15:46:26,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 15:46:26,949 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 15:46:26,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 15:46:26,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 15:46:26,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 15:46:26,949 INFO L87 Difference]: Start difference. First operand 365 states and 552 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-19 15:46:26,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 15:46:26,998 INFO L93 Difference]: Finished difference Result 635 states and 960 transitions. [2023-12-19 15:46:26,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 15:46:26,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 107 [2023-12-19 15:46:26,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 15:46:27,000 INFO L225 Difference]: With dead ends: 635 [2023-12-19 15:46:27,000 INFO L226 Difference]: Without dead ends: 401 [2023-12-19 15:46:27,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 15:46:27,001 INFO L413 NwaCegarLoop]: 174 mSDtfsCounter, 77 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 15:46:27,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 648 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 15:46:27,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2023-12-19 15:46:27,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 371. [2023-12-19 15:46:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 371 states, 334 states have (on average 1.473053892215569) internal successors, (492), 334 states have internal predecessors, (492), 33 states have call successors, (33), 3 states have call predecessors, (33), 3 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2023-12-19 15:46:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 558 transitions. [2023-12-19 15:46:27,018 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 558 transitions. Word has length 107 [2023-12-19 15:46:27,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 15:46:27,019 INFO L495 AbstractCegarLoop]: Abstraction has 371 states and 558 transitions. [2023-12-19 15:46:27,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2023-12-19 15:46:27,019 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 558 transitions. [2023-12-19 15:46:27,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-19 15:46:27,019 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 15:46:27,020 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:27,020 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 15:46:27,020 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 15:46:27,020 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 15:46:27,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1593916652, now seen corresponding path program 1 times [2023-12-19 15:46:27,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 15:46:27,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794909641] [2023-12-19 15:46:27,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 15:46:27,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 15:46:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:46:27,052 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 15:46:27,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 15:46:27,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 15:46:27,117 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 15:46:27,118 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 15:46:27,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 15:46:27,121 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 15:46:27,123 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 15:46:27,180 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:46:27 BoogieIcfgContainer [2023-12-19 15:46:27,180 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 15:46:27,180 INFO L158 Benchmark]: Toolchain (without parser) took 6802.11ms. Allocated memory was 207.6MB in the beginning and 327.2MB in the end (delta: 119.5MB). Free memory was 165.2MB in the beginning and 164.1MB in the end (delta: 1.1MB). Peak memory consumption was 121.1MB. Max. memory is 8.0GB. [2023-12-19 15:46:27,180 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 15:46:27,180 INFO L158 Benchmark]: CACSL2BoogieTranslator took 256.69ms. Allocated memory is still 207.6MB. Free memory was 164.8MB in the beginning and 148.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-19 15:46:27,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.53ms. Allocated memory is still 207.6MB. Free memory was 148.4MB in the beginning and 144.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 15:46:27,181 INFO L158 Benchmark]: Boogie Preprocessor took 65.93ms. Allocated memory is still 207.6MB. Free memory was 144.2MB in the beginning and 139.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-19 15:46:27,181 INFO L158 Benchmark]: RCFGBuilder took 614.60ms. Allocated memory was 207.6MB in the beginning and 264.2MB in the end (delta: 56.6MB). Free memory was 139.4MB in the beginning and 228.3MB in the end (delta: -89.0MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. [2023-12-19 15:46:27,181 INFO L158 Benchmark]: TraceAbstraction took 5800.63ms. Allocated memory was 264.2MB in the beginning and 327.2MB in the end (delta: 62.9MB). Free memory was 227.3MB in the beginning and 164.1MB in the end (delta: 63.2MB). Peak memory consumption was 126.1MB. Max. memory is 8.0GB. [2023-12-19 15:46:27,183 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 207.6MB. Free memory is still 159.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 256.69ms. Allocated memory is still 207.6MB. Free memory was 164.8MB in the beginning and 148.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 59.53ms. Allocated memory is still 207.6MB. Free memory was 148.4MB in the beginning and 144.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 65.93ms. Allocated memory is still 207.6MB. Free memory was 144.2MB in the beginning and 139.4MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 614.60ms. Allocated memory was 207.6MB in the beginning and 264.2MB in the end (delta: 56.6MB). Free memory was 139.4MB in the beginning and 228.3MB in the end (delta: -89.0MB). Peak memory consumption was 36.9MB. Max. memory is 8.0GB. * TraceAbstraction took 5800.63ms. Allocated memory was 264.2MB in the beginning and 327.2MB in the end (delta: 62.9MB). Free memory was 227.3MB in the beginning and 164.1MB in the end (delta: 63.2MB). Peak memory consumption was 126.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryDOUBLEComparisonOperation at line 112, overapproximation of shiftRight at line 55. Possible FailurePath: [L36] unsigned char isInitial = 0; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L37-L50] struct WrapperStruct00 WrapperStruct00 = { 1, 9999999999.875, 0, 4.25, 1, 1, 64.2, 9.5, 199.5, 3.5, 1, 2 }; [L51] unsigned char last_1_WrapperStruct00_var_1_14 = 1; [L116] isInitial = 1 [L117] FCALL initially() [L118] COND TRUE 1 [L119] CALL updateLastVariables() [L109] EXPR WrapperStruct00.var_1_14 [L109] last_1_WrapperStruct00_var_1_14 = WrapperStruct00.var_1_14 [L119] RET updateLastVariables() [L120] CALL updateVariables() [L88] WrapperStruct00.var_1_3 = __VERIFIER_nondet_float() [L89] EXPR WrapperStruct00.var_1_3 [L89] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L89] EXPR WrapperStruct00.var_1_3 [L89] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L89] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_uchar() [L91] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_4 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L92] EXPR WrapperStruct00.var_1_4 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_4 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L93] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L94] EXPR WrapperStruct00.var_1_5 [L94] EXPR WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] EXPR (WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L94] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L95] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L96] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L97] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L98] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_11 [L99] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_11 [L99] EXPR WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] EXPR (WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L100] WrapperStruct00.var_1_12 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_12 [L101] EXPR WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] EXPR (WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_12 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_12 <= -1.0e-20F) || (WrapperStruct00.var_1_12 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_12 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L102] WrapperStruct00.var_1_13 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_13 [L103] EXPR WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && WrapperStruct00.var_1_13 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && 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_14=1] [L103] EXPR (WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && 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_14=1] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && 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_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_13 >= -922337.2036854765600e+13F && 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_14=1] [L104] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L105] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, cond=1, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L106] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 254) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L120] RET updateVariables() [L121] CALL step() [L55] EXPR last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L55] COND FALSE !((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) [L58] EXPR WrapperStruct00.var_1_13 [L58] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L58] COND FALSE !(WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) [L65] WrapperStruct00.var_1_14 = 0 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L67] EXPR WrapperStruct00.var_1_5 [L67] EXPR WrapperStruct00.var_1_3 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L67] COND TRUE WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3 [L68] WrapperStruct00.var_1_10 = 4.6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L72] EXPR WrapperStruct00.var_1_10 [L72] EXPR WrapperStruct00.var_1_10 [L72] unsigned char stepLocal_0 = WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10; [L73] stepLocal_0 && WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1, stepLocal_0=1] [L73] stepLocal_0 && WrapperStruct00.var_1_7 [L73] EXPR WrapperStruct00.var_1_7 [L73] stepLocal_0 && WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1, stepLocal_0=1] [L73] COND TRUE stepLocal_0 && WrapperStruct00.var_1_7 [L74] EXPR WrapperStruct00.var_1_10 [L74] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L74] EXPR ((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)) [L74] EXPR WrapperStruct00.var_1_10 [L74] EXPR ((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1, stepLocal_0=1] [L74] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L74] COND TRUE ((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10 [L75] WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L75] COND TRUE WrapperStruct00.var_1_7 [L76] WrapperStruct00.var_1_1 = 10u VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L121] RET step() [L122] CALL, EXPR property() [L112] EXPR WrapperStruct00.var_1_10 [L112] EXPR WrapperStruct00.var_1_10 [L112] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14)) [L112] EXPR WrapperStruct00.var_1_1 [L112] EXPR WrapperStruct00.var_1_14 [L112] EXPR ((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR ((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR ((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))) && ((WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) ? ((WrapperStruct00.var_1_7 && WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) 0))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112] EXPR (((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))) && ((WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) ? ((WrapperStruct00.var_1_7 && WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) 0))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_14=1] [L112-L113] return (((((WrapperStruct00.var_1_10 > WrapperStruct00.var_1_10) && WrapperStruct00.var_1_7) ? ((((((WrapperStruct00.var_1_10) > ((- WrapperStruct00.var_1_10))) ? (WrapperStruct00.var_1_10) : ((- WrapperStruct00.var_1_10)))) != WrapperStruct00.var_1_10) ? (WrapperStruct00.var_1_7 ? (WrapperStruct00.var_1_1 == ((unsigned long int) 10u)) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_1 == ((unsigned long int) WrapperStruct00.var_1_14))) && (((last_1_WrapperStruct00_var_1_14 >> last_1_WrapperStruct00_var_1_14) < (- last_1_WrapperStruct00_var_1_14)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (WrapperStruct00.var_1_4 || WrapperStruct00.var_1_9))) : 1)) && ((WrapperStruct00.var_1_5 > WrapperStruct00.var_1_3) ? (WrapperStruct00.var_1_10 == ((double) 4.6)) : (WrapperStruct00.var_1_10 == ((double) ((((WrapperStruct00.var_1_11) > (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13))))) ? (WrapperStruct00.var_1_11) : (((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_13)))))))))) && ((WrapperStruct00.var_1_13 == (- WrapperStruct00.var_1_12)) ? ((WrapperStruct00.var_1_7 && WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16)) : (WrapperStruct00.var_1_14 == ((unsigned char) WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_14 == ((unsigned char) 0))) ; [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_14=1] [L19] reach_error() VAL [WrapperStruct00={4:0}, \old(cond)=0, cond=0, isInitial=1, last_1_WrapperStruct00_var_1_14=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 9, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1309 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1307 mSDsluCounter, 3654 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2526 mSDsCounter, 140 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1841 IncrementalHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 140 mSolverCounterUnsat, 1128 mSDtfsCounter, 1841 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 269 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=423occurred in iteration=6, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 975 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 945 NumberOfCodeBlocks, 945 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 1977 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 1760/1760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 15:46:27,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...