/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-97.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-20 18:44:25,937 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-20 18:44:26,013 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-20 18:44:26,018 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-20 18:44:26,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-20 18:44:26,050 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-20 18:44:26,050 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-20 18:44:26,050 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-20 18:44:26,051 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-20 18:44:26,051 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-20 18:44:26,051 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-20 18:44:26,052 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-20 18:44:26,052 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-20 18:44:26,052 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-20 18:44:26,052 INFO L153 SettingsManager]: * Use SBE=true [2023-12-20 18:44:26,053 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-20 18:44:26,053 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-20 18:44:26,053 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-20 18:44:26,053 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-20 18:44:26,054 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-20 18:44:26,054 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-20 18:44:26,057 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-20 18:44:26,057 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-20 18:44:26,057 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-20 18:44:26,060 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-20 18:44:26,061 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-20 18:44:26,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-20 18:44:26,061 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-20 18:44:26,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-20 18:44:26,062 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-20 18:44:26,062 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-20 18:44:26,062 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-20 18:44:26,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 18:44:26,063 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-20 18:44:26,063 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-20 18:44:26,063 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-20 18:44:26,063 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-20 18:44:26,063 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-20 18:44:26,063 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-20 18:44:26,063 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-20 18:44:26,063 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-20 18:44:26,064 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-20 18:44:26,064 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-20 18:44:26,064 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-20 18:44:26,265 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-20 18:44:26,285 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-20 18:44:26,287 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-20 18:44:26,288 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-20 18:44:26,288 INFO L274 PluginConnector]: CDTParser initialized [2023-12-20 18:44:26,289 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-97.i [2023-12-20 18:44:27,366 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-20 18:44:27,544 INFO L384 CDTParser]: Found 1 translation units. [2023-12-20 18:44:27,545 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-97.i [2023-12-20 18:44:27,550 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a72ef24b/6b3d6de0a195447fbb61fa9d152b59e3/FLAG824d0874c [2023-12-20 18:44:27,563 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a72ef24b/6b3d6de0a195447fbb61fa9d152b59e3 [2023-12-20 18:44:27,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-20 18:44:27,565 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-20 18:44:27,566 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-20 18:44:27,566 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-20 18:44:27,570 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-20 18:44:27,570 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,571 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@361e3306 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27, skipping insertion in model container [2023-12-20 18:44:27,572 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,606 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-20 18:44:27,719 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_codestructure_dependencies_file-97.i[919,932] [2023-12-20 18:44:27,767 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 18:44:27,775 INFO L202 MainTranslator]: Completed pre-run [2023-12-20 18:44:27,783 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_codestructure_dependencies_file-97.i[919,932] [2023-12-20 18:44:27,802 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-20 18:44:27,813 INFO L206 MainTranslator]: Completed translation [2023-12-20 18:44:27,814 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27 WrapperNode [2023-12-20 18:44:27,814 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-20 18:44:27,815 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-20 18:44:27,815 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-20 18:44:27,815 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-20 18:44:27,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,827 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,857 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2023-12-20 18:44:27,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-20 18:44:27,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-20 18:44:27,858 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-20 18:44:27,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-20 18:44:27,867 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,870 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,901 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-20 18:44:27,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,914 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-20 18:44:27,929 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-20 18:44:27,930 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-20 18:44:27,930 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-20 18:44:27,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (1/1) ... [2023-12-20 18:44:27,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-20 18:44:27,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-20 18:44:27,954 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-20 18:44:27,964 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-20 18:44:27,983 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-20 18:44:27,983 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-20 18:44:27,984 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-20 18:44:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-20 18:44:27,985 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-20 18:44:27,985 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-20 18:44:28,055 INFO L241 CfgBuilder]: Building ICFG [2023-12-20 18:44:28,057 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-20 18:44:28,397 INFO L282 CfgBuilder]: Performing block encoding [2023-12-20 18:44:28,432 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-20 18:44:28,433 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-20 18:44:28,433 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 06:44:28 BoogieIcfgContainer [2023-12-20 18:44:28,433 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-20 18:44:28,435 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-20 18:44:28,435 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-20 18:44:28,438 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-20 18:44:28,438 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.12 06:44:27" (1/3) ... [2023-12-20 18:44:28,438 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cd91ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 06:44:28, skipping insertion in model container [2023-12-20 18:44:28,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.12 06:44:27" (2/3) ... [2023-12-20 18:44:28,439 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20cd91ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.12 06:44:28, skipping insertion in model container [2023-12-20 18:44:28,439 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.12 06:44:28" (3/3) ... [2023-12-20 18:44:28,440 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-97.i [2023-12-20 18:44:28,452 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-20 18:44:28,452 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-20 18:44:28,493 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-20 18:44:28,498 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;@c572ce1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-20 18:44:28,498 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-20 18:44:28,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 18:44:28,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 18:44:28,522 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:44:28,523 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:44:28,523 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:44:28,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:44:28,529 INFO L85 PathProgramCache]: Analyzing trace with hash -343675512, now seen corresponding path program 1 times [2023-12-20 18:44:28,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:44:28,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477192990] [2023-12-20 18:44:28,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:44:28,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:44:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:44:28,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 18:44:28,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 18:44:28,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 18:44:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 18:44:28,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 18:44:28,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 18:44:28,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 18:44:28,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 18:44:28,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 18:44:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 18:44:28,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 18:44:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 18:44:28,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 18:44:28,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 18:44:28,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 18:44:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:28,866 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 18:44:28,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:44:28,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477192990] [2023-12-20 18:44:28,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477192990] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:44:28,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:44:28,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-20 18:44:28,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867682641] [2023-12-20 18:44:28,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:44:28,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-20 18:44:28,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:44:28,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-20 18:44:28,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-20 18:44:28,900 INFO L87 Difference]: Start difference. First operand has 56 states, 37 states have (on average 1.4864864864864864) internal successors, (55), 38 states have internal predecessors, (55), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 18:44:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:44:28,937 INFO L93 Difference]: Finished difference Result 109 states and 188 transitions. [2023-12-20 18:44:28,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-20 18:44:28,940 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2023-12-20 18:44:28,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:44:28,946 INFO L225 Difference]: With dead ends: 109 [2023-12-20 18:44:28,946 INFO L226 Difference]: Without dead ends: 54 [2023-12-20 18:44:28,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 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-20 18:44:28,953 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 18:44:28,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 79 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 18:44:28,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-12-20 18:44:28,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-12-20 18:44:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.3888888888888888) internal successors, (50), 36 states have internal predecessors, (50), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 18:44:28,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 82 transitions. [2023-12-20 18:44:28,991 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 82 transitions. Word has length 103 [2023-12-20 18:44:28,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:44:28,991 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 82 transitions. [2023-12-20 18:44:28,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-12-20 18:44:28,992 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 82 transitions. [2023-12-20 18:44:28,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 18:44:28,995 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:44:28,996 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:44:28,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-20 18:44:28,996 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:44:28,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:44:28,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1083630796, now seen corresponding path program 1 times [2023-12-20 18:44:28,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:44:28,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379932953] [2023-12-20 18:44:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:44:28,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:44:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:44:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 18:44:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 18:44:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 18:44:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 18:44:29,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 18:44:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 18:44:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 18:44:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 18:44:29,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 18:44:29,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 18:44:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 18:44:29,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 18:44:29,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 18:44:29,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 18:44:29,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 18:44:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,198 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 18:44:29,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:44:29,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379932953] [2023-12-20 18:44:29,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379932953] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:44:29,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:44:29,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 18:44:29,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419361691] [2023-12-20 18:44:29,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:44:29,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 18:44:29,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:44:29,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 18:44:29,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 18:44:29,208 INFO L87 Difference]: Start difference. First operand 54 states and 82 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:29,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:44:29,279 INFO L93 Difference]: Finished difference Result 156 states and 236 transitions. [2023-12-20 18:44:29,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 18:44:29,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2023-12-20 18:44:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:44:29,282 INFO L225 Difference]: With dead ends: 156 [2023-12-20 18:44:29,282 INFO L226 Difference]: Without dead ends: 103 [2023-12-20 18:44:29,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 18:44:29,283 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 70 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 18:44:29,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 201 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 18:44:29,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2023-12-20 18:44:29,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2023-12-20 18:44:29,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.391304347826087) internal successors, (64), 46 states have internal predecessors, (64), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-20 18:44:29,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 96 transitions. [2023-12-20 18:44:29,292 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 96 transitions. Word has length 103 [2023-12-20 18:44:29,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:44:29,293 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 96 transitions. [2023-12-20 18:44:29,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:29,293 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 96 transitions. [2023-12-20 18:44:29,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-12-20 18:44:29,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:44:29,294 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:44:29,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-20 18:44:29,295 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:44:29,295 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:44:29,295 INFO L85 PathProgramCache]: Analyzing trace with hash 690603786, now seen corresponding path program 1 times [2023-12-20 18:44:29,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:44:29,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245915221] [2023-12-20 18:44:29,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:44:29,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:44:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:44:29,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 18:44:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 18:44:29,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 18:44:29,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 18:44:29,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 18:44:29,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 18:44:29,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 18:44:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 18:44:29,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 18:44:29,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 18:44:29,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 18:44:29,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 18:44:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 18:44:29,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 18:44:29,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 18:44:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,666 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 18:44:29,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:44:29,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245915221] [2023-12-20 18:44:29,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245915221] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:44:29,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:44:29,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 18:44:29,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27208357] [2023-12-20 18:44:29,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:44:29,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 18:44:29,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:44:29,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 18:44:29,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-20 18:44:29,672 INFO L87 Difference]: Start difference. First operand 64 states and 96 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:29,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:44:29,786 INFO L93 Difference]: Finished difference Result 220 states and 332 transitions. [2023-12-20 18:44:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 18:44:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2023-12-20 18:44:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:44:29,789 INFO L225 Difference]: With dead ends: 220 [2023-12-20 18:44:29,789 INFO L226 Difference]: Without dead ends: 157 [2023-12-20 18:44:29,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-12-20 18:44:29,790 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 121 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 18:44:29,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 214 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 18:44:29,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-12-20 18:44:29,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 123. [2023-12-20 18:44:29,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 88 states have (on average 1.375) internal successors, (121), 88 states have internal predecessors, (121), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-20 18:44:29,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 185 transitions. [2023-12-20 18:44:29,809 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 185 transitions. Word has length 103 [2023-12-20 18:44:29,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:44:29,811 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 185 transitions. [2023-12-20 18:44:29,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:29,811 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 185 transitions. [2023-12-20 18:44:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-20 18:44:29,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:44:29,818 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:44:29,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-20 18:44:29,819 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:44:29,819 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:44:29,819 INFO L85 PathProgramCache]: Analyzing trace with hash -326380607, now seen corresponding path program 1 times [2023-12-20 18:44:29,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:44:29,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935143923] [2023-12-20 18:44:29,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:44:29,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:44:29,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:44:29,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 18:44:29,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 18:44:29,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 18:44:29,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 18:44:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 18:44:29,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 18:44:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 18:44:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:29,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 18:44:30,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 18:44:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 18:44:30,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 18:44:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 18:44:30,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 18:44:30,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 18:44:30,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 18:44:30,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,017 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 18:44:30,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:44:30,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935143923] [2023-12-20 18:44:30,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935143923] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:44:30,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:44:30,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 18:44:30,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082481789] [2023-12-20 18:44:30,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:44:30,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 18:44:30,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:44:30,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 18:44:30,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 18:44:30,020 INFO L87 Difference]: Start difference. First operand 123 states and 185 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:30,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:44:30,309 INFO L93 Difference]: Finished difference Result 270 states and 403 transitions. [2023-12-20 18:44:30,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-20 18:44:30,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-12-20 18:44:30,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:44:30,311 INFO L225 Difference]: With dead ends: 270 [2023-12-20 18:44:30,312 INFO L226 Difference]: Without dead ends: 207 [2023-12-20 18:44:30,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 36 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-20 18:44:30,313 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 122 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 18:44:30,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 289 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 18:44:30,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-12-20 18:44:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 125. [2023-12-20 18:44:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-20 18:44:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 188 transitions. [2023-12-20 18:44:30,374 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 188 transitions. Word has length 104 [2023-12-20 18:44:30,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:44:30,375 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 188 transitions. [2023-12-20 18:44:30,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:30,375 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 188 transitions. [2023-12-20 18:44:30,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-12-20 18:44:30,378 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:44:30,378 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:44:30,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-20 18:44:30,378 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:44:30,378 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:44:30,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1062169761, now seen corresponding path program 1 times [2023-12-20 18:44:30,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:44:30,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635473197] [2023-12-20 18:44:30,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:44:30,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:44:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:44:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 18:44:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 18:44:30,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 18:44:30,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 18:44:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 18:44:30,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 18:44:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 18:44:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 18:44:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 18:44:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 18:44:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 18:44:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 18:44:30,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 18:44:30,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 18:44:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 18:44:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:30,691 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 18:44:30,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:44:30,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635473197] [2023-12-20 18:44:30,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635473197] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:44:30,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:44:30,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-20 18:44:30,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728068082] [2023-12-20 18:44:30,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:44:30,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-20 18:44:30,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:44:30,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-20 18:44:30,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-20 18:44:30,695 INFO L87 Difference]: Start difference. First operand 125 states and 188 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:30,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:44:30,828 INFO L93 Difference]: Finished difference Result 311 states and 466 transitions. [2023-12-20 18:44:30,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 18:44:30,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-12-20 18:44:30,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:44:30,834 INFO L225 Difference]: With dead ends: 311 [2023-12-20 18:44:30,834 INFO L226 Difference]: Without dead ends: 187 [2023-12-20 18:44:30,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-20 18:44:30,842 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 63 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-20 18:44:30,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 335 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-20 18:44:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-12-20 18:44:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 177. [2023-12-20 18:44:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 125 states have (on average 1.344) internal successors, (168), 125 states have internal predecessors, (168), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-20 18:44:30,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 264 transitions. [2023-12-20 18:44:30,876 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 264 transitions. Word has length 104 [2023-12-20 18:44:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:44:30,877 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 264 transitions. [2023-12-20 18:44:30,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 264 transitions. [2023-12-20 18:44:30,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2023-12-20 18:44:30,878 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:44:30,878 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:44:30,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-20 18:44:30,892 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:44:30,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:44:30,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1164256456, now seen corresponding path program 1 times [2023-12-20 18:44:30,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:44:30,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082623271] [2023-12-20 18:44:30,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:44:30,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:44:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:44:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 18:44:31,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 18:44:31,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 18:44:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 18:44:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 18:44:31,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 18:44:31,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 18:44:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 18:44:31,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 18:44:31,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 18:44:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 18:44:31,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 18:44:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 18:44:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 18:44:31,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 18:44:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,175 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 18:44:31,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:44:31,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082623271] [2023-12-20 18:44:31,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082623271] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:44:31,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:44:31,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-20 18:44:31,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710841615] [2023-12-20 18:44:31,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:44:31,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-20 18:44:31,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:44:31,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-20 18:44:31,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-20 18:44:31,177 INFO L87 Difference]: Start difference. First operand 177 states and 264 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:31,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:44:31,224 INFO L93 Difference]: Finished difference Result 301 states and 451 transitions. [2023-12-20 18:44:31,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-20 18:44:31,224 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 105 [2023-12-20 18:44:31,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:44:31,225 INFO L225 Difference]: With dead ends: 301 [2023-12-20 18:44:31,225 INFO L226 Difference]: Without dead ends: 177 [2023-12-20 18:44:31,226 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-20 18:44:31,226 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 70 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 18:44:31,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 294 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 18:44:31,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2023-12-20 18:44:31,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2023-12-20 18:44:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 125 states have (on average 1.296) internal successors, (162), 125 states have internal predecessors, (162), 48 states have call successors, (48), 3 states have call predecessors, (48), 3 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-20 18:44:31,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 258 transitions. [2023-12-20 18:44:31,251 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 258 transitions. Word has length 105 [2023-12-20 18:44:31,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:44:31,251 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 258 transitions. [2023-12-20 18:44:31,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:31,251 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 258 transitions. [2023-12-20 18:44:31,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-20 18:44:31,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:44:31,252 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:44:31,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-20 18:44:31,252 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:44:31,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:44:31,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1352712347, now seen corresponding path program 1 times [2023-12-20 18:44:31,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:44:31,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825783504] [2023-12-20 18:44:31,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:44:31,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:44:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:44:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 18:44:31,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 18:44:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 18:44:31,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 18:44:31,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 18:44:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 18:44:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 18:44:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 18:44:31,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 18:44:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 18:44:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 18:44:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 18:44:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 18:44:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 18:44:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 18:44:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,414 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 18:44:31,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:44:31,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825783504] [2023-12-20 18:44:31,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825783504] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:44:31,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:44:31,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-20 18:44:31,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058406606] [2023-12-20 18:44:31,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:44:31,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-20 18:44:31,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:44:31,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-20 18:44:31,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-20 18:44:31,415 INFO L87 Difference]: Start difference. First operand 177 states and 258 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:31,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:44:31,710 INFO L93 Difference]: Finished difference Result 433 states and 620 transitions. [2023-12-20 18:44:31,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-20 18:44:31,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 108 [2023-12-20 18:44:31,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:44:31,712 INFO L225 Difference]: With dead ends: 433 [2023-12-20 18:44:31,712 INFO L226 Difference]: Without dead ends: 368 [2023-12-20 18:44:31,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-12-20 18:44:31,713 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 159 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-20 18:44:31,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 335 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-20 18:44:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2023-12-20 18:44:31,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 301. [2023-12-20 18:44:31,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 215 states have (on average 1.302325581395349) internal successors, (280), 215 states have internal predecessors, (280), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-20 18:44:31,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 440 transitions. [2023-12-20 18:44:31,768 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 440 transitions. Word has length 108 [2023-12-20 18:44:31,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:44:31,768 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 440 transitions. [2023-12-20 18:44:31,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:31,768 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 440 transitions. [2023-12-20 18:44:31,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-20 18:44:31,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:44:31,769 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:44:31,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-20 18:44:31,769 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:44:31,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:44:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash 60091203, now seen corresponding path program 1 times [2023-12-20 18:44:31,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:44:31,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186348911] [2023-12-20 18:44:31,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:44:31,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:44:31,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:44:31,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 18:44:31,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 18:44:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 18:44:31,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 18:44:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 18:44:31,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 18:44:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 18:44:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 18:44:31,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 18:44:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 18:44:31,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 18:44:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 18:44:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 18:44:31,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 18:44:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 18:44:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:31,821 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 18:44:31,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:44:31,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186348911] [2023-12-20 18:44:31,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186348911] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:44:31,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:44:31,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-20 18:44:31,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917986299] [2023-12-20 18:44:31,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:44:31,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-20 18:44:31,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:44:31,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-20 18:44:31,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 18:44:31,822 INFO L87 Difference]: Start difference. First operand 301 states and 440 transitions. Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:31,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:44:31,894 INFO L93 Difference]: Finished difference Result 563 states and 821 transitions. [2023-12-20 18:44:31,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-20 18:44:31,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-12-20 18:44:31,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:44:31,896 INFO L225 Difference]: With dead ends: 563 [2023-12-20 18:44:31,896 INFO L226 Difference]: Without dead ends: 305 [2023-12-20 18:44:31,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-20 18:44:31,897 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 58 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-20 18:44:31,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 141 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-20 18:44:31,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2023-12-20 18:44:31,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 264. [2023-12-20 18:44:31,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 178 states have (on average 1.1741573033707866) internal successors, (209), 178 states have internal predecessors, (209), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2023-12-20 18:44:31,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 369 transitions. [2023-12-20 18:44:31,948 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 369 transitions. Word has length 109 [2023-12-20 18:44:31,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:44:31,948 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 369 transitions. [2023-12-20 18:44:31,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:44:31,948 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 369 transitions. [2023-12-20 18:44:31,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-20 18:44:31,949 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:44:31,949 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:44:31,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-20 18:44:31,949 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:44:31,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:44:31,950 INFO L85 PathProgramCache]: Analyzing trace with hash 117349505, now seen corresponding path program 1 times [2023-12-20 18:44:31,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:44:31,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38218463] [2023-12-20 18:44:31,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:44:31,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:44:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-20 18:44:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-12-20 18:44:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-12-20 18:44:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2023-12-20 18:44:55,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-12-20 18:44:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2023-12-20 18:44:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2023-12-20 18:44:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-20 18:44:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-20 18:44:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2023-12-20 18:44:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2023-12-20 18:44:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2023-12-20 18:44:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2023-12-20 18:44:55,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2023-12-20 18:44:55,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2023-12-20 18:44:55,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2023-12-20 18:44:55,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-20 18:44:55,711 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-20 18:44:55,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-20 18:44:55,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38218463] [2023-12-20 18:44:55,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38218463] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-20 18:44:55,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-20 18:44:55,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-12-20 18:44:55,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873604876] [2023-12-20 18:44:55,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-20 18:44:55,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-20 18:44:55,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-20 18:44:55,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-20 18:44:55,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2023-12-20 18:44:55,713 INFO L87 Difference]: Start difference. First operand 264 states and 369 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:45:04,209 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-20 18:45:09,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-20 18:45:09,808 INFO L93 Difference]: Finished difference Result 459 states and 598 transitions. [2023-12-20 18:45:09,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-20 18:45:09,809 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 109 [2023-12-20 18:45:09,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-20 18:45:09,812 INFO L225 Difference]: With dead ends: 459 [2023-12-20 18:45:09,812 INFO L226 Difference]: Without dead ends: 457 [2023-12-20 18:45:09,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2023-12-20 18:45:09,814 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 129 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 15 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2023-12-20 18:45:09,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 283 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 257 Invalid, 1 Unknown, 0 Unchecked, 4.8s Time] [2023-12-20 18:45:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2023-12-20 18:45:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 407. [2023-12-20 18:45:09,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 309 states have (on average 1.1844660194174756) internal successors, (366), 313 states have internal predecessors, (366), 88 states have call successors, (88), 9 states have call predecessors, (88), 9 states have return successors, (88), 84 states have call predecessors, (88), 88 states have call successors, (88) [2023-12-20 18:45:09,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 542 transitions. [2023-12-20 18:45:09,878 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 542 transitions. Word has length 109 [2023-12-20 18:45:09,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-20 18:45:09,878 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 542 transitions. [2023-12-20 18:45:09,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-20 18:45:09,879 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 542 transitions. [2023-12-20 18:45:09,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-12-20 18:45:09,879 INFO L187 NwaCegarLoop]: Found error trace [2023-12-20 18:45:09,879 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 18:45:09,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-20 18:45:09,880 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-20 18:45:09,880 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-20 18:45:09,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1876795201, now seen corresponding path program 1 times [2023-12-20 18:45:09,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-20 18:45:09,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589912369] [2023-12-20 18:45:09,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-20 18:45:09,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-20 18:45:09,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 18:45:09,917 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-20 18:45:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-20 18:45:09,974 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-20 18:45:09,974 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-20 18:45:09,975 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-20 18:45:09,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-20 18:45:09,979 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-20 18:45:09,981 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-20 18:45:10,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.12 06:45:10 BoogieIcfgContainer [2023-12-20 18:45:10,060 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-20 18:45:10,060 INFO L158 Benchmark]: Toolchain (without parser) took 42494.91ms. Allocated memory was 272.6MB in the beginning and 632.3MB in the end (delta: 359.7MB). Free memory was 219.0MB in the beginning and 393.4MB in the end (delta: -174.4MB). Peak memory consumption was 186.3MB. Max. memory is 8.0GB. [2023-12-20 18:45:10,060 INFO L158 Benchmark]: CDTParser took 1.11ms. Allocated memory is still 201.3MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-20 18:45:10,061 INFO L158 Benchmark]: CACSL2BoogieTranslator took 247.94ms. Allocated memory is still 272.6MB. Free memory was 218.5MB in the beginning and 204.8MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-20 18:45:10,061 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.22ms. Allocated memory is still 272.6MB. Free memory was 204.8MB in the beginning and 201.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-20 18:45:10,061 INFO L158 Benchmark]: Boogie Preprocessor took 70.55ms. Allocated memory is still 272.6MB. Free memory was 201.2MB in the beginning and 194.4MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-20 18:45:10,061 INFO L158 Benchmark]: RCFGBuilder took 503.76ms. Allocated memory is still 272.6MB. Free memory was 194.4MB in the beginning and 233.6MB in the end (delta: -39.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2023-12-20 18:45:10,061 INFO L158 Benchmark]: TraceAbstraction took 41624.92ms. Allocated memory was 272.6MB in the beginning and 632.3MB in the end (delta: 359.7MB). Free memory was 233.1MB in the beginning and 393.4MB in the end (delta: -160.3MB). Peak memory consumption was 199.9MB. Max. memory is 8.0GB. [2023-12-20 18:45:10,063 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.11ms. Allocated memory is still 201.3MB. Free memory is still 147.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 247.94ms. Allocated memory is still 272.6MB. Free memory was 218.5MB in the beginning and 204.8MB in the end (delta: 13.7MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.22ms. Allocated memory is still 272.6MB. Free memory was 204.8MB in the beginning and 201.2MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 70.55ms. Allocated memory is still 272.6MB. Free memory was 201.2MB in the beginning and 194.4MB in the end (delta: 6.8MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 503.76ms. Allocated memory is still 272.6MB. Free memory was 194.4MB in the beginning and 233.6MB in the end (delta: -39.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 41624.92ms. Allocated memory was 272.6MB in the beginning and 632.3MB in the end (delta: 359.7MB). Free memory was 233.1MB in the beginning and 393.4MB in the end (delta: -160.3MB). Peak memory consumption was 199.9MB. 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 117, overapproximation of bitwise operation at line 117. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 2; [L23] signed long int var_1_5 = 5; [L24] unsigned char var_1_8 = 0; [L25] float var_1_9 = 128.6; [L26] float var_1_10 = 32.5; [L27] unsigned char var_1_11 = 16; [L28] unsigned char var_1_12 = 64; [L29] unsigned char var_1_13 = 4; [L30] unsigned char var_1_14 = 4; [L31] unsigned long int var_1_15 = 0; [L32] signed short int var_1_16 = 0; [L33] signed char var_1_17 = 1; [L34] signed char var_1_18 = -1; [L35] signed char var_1_19 = 0; [L36] signed long int var_1_20 = -64; [L37] unsigned char var_1_22 = 0; [L38] unsigned char var_1_23 = 0; [L39] signed long int last_1_var_1_5 = 5; [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L114] last_1_var_1_5 = var_1_5 [L124] RET updateLastVariables() [L125] CALL updateVariables() [L87] var_1_9 = __VERIFIER_nondet_float() [L88] CALL assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L88] RET assume_abort_if_not((var_1_9 >= -922337.2036854776000e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854776000e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_10=65/2, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L89] var_1_10 = __VERIFIER_nondet_float() [L90] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L90] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=16, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L91] var_1_11 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L92] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] CALL assume_abort_if_not(var_1_11 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L93] RET assume_abort_if_not(var_1_11 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=64, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L94] var_1_12 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_12 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L95] RET assume_abort_if_not(var_1_12 >= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] CALL assume_abort_if_not(var_1_12 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L96] RET assume_abort_if_not(var_1_12 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=4, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L97] var_1_13 = __VERIFIER_nondet_uchar() [L98] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L98] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] CALL assume_abort_if_not(var_1_13 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L99] RET assume_abort_if_not(var_1_13 <= 63) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=4, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L100] var_1_14 = __VERIFIER_nondet_uchar() [L101] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L101] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] CALL assume_abort_if_not(var_1_14 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L102] RET assume_abort_if_not(var_1_14 <= 127) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-1, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L103] var_1_18 = __VERIFIER_nondet_char() [L104] CALL assume_abort_if_not(var_1_18 >= -31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L104] RET assume_abort_if_not(var_1_18 >= -31) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] CALL assume_abort_if_not(var_1_18 <= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L105] RET assume_abort_if_not(var_1_18 <= 32) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=0, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L106] var_1_19 = __VERIFIER_nondet_char() [L107] CALL assume_abort_if_not(var_1_19 >= -15) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L107] RET assume_abort_if_not(var_1_19 >= -15) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] CALL assume_abort_if_not(var_1_19 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L108] RET assume_abort_if_not(var_1_19 <= 16) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L109] var_1_23 = __VERIFIER_nondet_uchar() [L110] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L110] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_5=5, var_1_8=0] [L111] CALL assume_abort_if_not(var_1_23 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L111] RET assume_abort_if_not(var_1_23 <= 0) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L125] RET updateVariables() [L126] CALL step() [L43] COND FALSE !(var_1_9 > var_1_10) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=-64, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L46] var_1_20 = var_1_8 [L47] var_1_22 = var_1_23 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L48] COND FALSE !(\read(var_1_22)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=0, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L51] var_1_16 = (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=1, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L52] COND FALSE !(\read(var_1_22)) [L59] var_1_17 = -32 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L61] COND TRUE (var_1_20 + var_1_15) < -200 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=2, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L62] COND FALSE !(\read(var_1_22)) [L69] var_1_1 = var_1_20 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L74] COND FALSE !(256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=5, var_1_8=0] [L77] COND FALSE !(var_1_22 || var_1_22) [L82] var_1_5 = -10000 VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117] EXPR (((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000)))) VAL [isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L117-L118] return (((((((((var_1_20 + var_1_15) < -200) ? (var_1_22 ? ((var_1_20 > (- var_1_15)) ? (var_1_1 == ((unsigned long int) var_1_20)) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) : (var_1_1 == ((unsigned long int) var_1_20))) && ((256 > (var_1_15 - (last_1_var_1_5 + var_1_8))) ? (var_1_5 == ((signed long int) last_1_var_1_5)) : ((var_1_22 || var_1_22) ? ((((32 * -25) | last_1_var_1_5) >= var_1_15) ? (var_1_5 == ((signed long int) var_1_8)) : 1) : (var_1_5 == ((signed long int) -10000))))) && ((var_1_9 > var_1_10) ? (var_1_8 == ((unsigned char) (((((var_1_11 + (var_1_12 - var_1_13))) < ((5 + var_1_14))) ? ((var_1_11 + (var_1_12 - var_1_13))) : ((5 + var_1_14)))))) : 1)) && (var_1_22 ? (var_1_15 == ((unsigned long int) var_1_8)) : 1)) && (var_1_16 == ((signed short int) (((((var_1_15) < (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12))))) ? (var_1_15) : (((((var_1_13) > (var_1_12)) ? (var_1_13) : (var_1_12)))))) - var_1_11)))) && (var_1_22 ? ((var_1_14 < (var_1_13 & (var_1_15 / 2))) ? (var_1_17 == ((signed char) (var_1_13 + (var_1_18 + (var_1_19 + 5))))) : (var_1_17 == ((signed char) var_1_18))) : (var_1_17 == ((signed char) -32)))) && (var_1_20 == ((signed long int) var_1_8))) && (var_1_22 == ((unsigned char) var_1_23)) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_5=5, var_1_11=127, var_1_12=63, var_1_13=63, var_1_14=122, var_1_15=0, var_1_16=-127, var_1_17=-32, var_1_18=-31, var_1_19=-15, var_1_1=0, var_1_20=0, var_1_22=0, var_1_23=0, var_1_5=-10000, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.5s, OverallIterations: 10, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 792 SdHoareTripleChecker+Valid, 5.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 792 mSDsluCounter, 2171 SdHoareTripleChecker+Invalid, 5.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1214 mSDsCounter, 245 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 652 IncrementalHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 245 mSolverCounterUnsat, 957 mSDtfsCounter, 652 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 366 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 13.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=407occurred in iteration=9, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 323 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 25.3s InterpolantComputationTime, 1057 NumberOfCodeBlocks, 1057 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 939 ConstructedInterpolants, 0 QuantifiedInterpolants, 11875 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 4320/4320 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-20 18:45:10,132 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...