/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-63.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 05:38:30,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 05:38:30,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 05:38:30,907 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 05:38:30,907 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 05:38:30,920 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 05:38:30,920 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 05:38:30,921 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 05:38:30,921 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 05:38:30,921 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 05:38:30,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 05:38:30,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 05:38:30,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 05:38:30,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 05:38:30,923 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 05:38:30,923 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 05:38:30,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 05:38:30,923 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 05:38:30,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 05:38:30,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 05:38:30,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 05:38:30,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 05:38:30,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 05:38:30,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 05:38:30,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 05:38:30,937 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 05:38:30,937 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 05:38:30,938 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 05:38:30,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 05:38:30,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 05:38:30,938 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 05:38:30,938 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 05:38:30,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 05:38:30,939 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 05:38:30,939 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 05:38:30,939 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 05:38:30,939 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 05:38:30,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 05:38:30,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 05:38:30,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 05:38:30,940 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 05:38:30,940 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 05:38:30,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 05:38:30,941 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 05:38:31,080 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 05:38:31,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 05:38:31,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 05:38:31,095 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 05:38:31,095 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 05:38:31,096 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-63.i [2023-12-19 05:38:32,221 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 05:38:32,422 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 05:38:32,423 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-63.i [2023-12-19 05:38:32,432 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1e46f4b/647b9361e74b479aab988f20e5e82323/FLAG1888bd54c [2023-12-19 05:38:32,449 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a1e46f4b/647b9361e74b479aab988f20e5e82323 [2023-12-19 05:38:32,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 05:38:32,454 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 05:38:32,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 05:38:32,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 05:38:32,460 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 05:38:32,460 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,462 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@318dbb02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32, skipping insertion in model container [2023-12-19 05:38:32,462 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,491 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 05:38:32,584 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-63.i[919,932] [2023-12-19 05:38:32,627 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 05:38:32,642 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 05:38:32,655 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-63.i[919,932] [2023-12-19 05:38:32,677 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 05:38:32,689 INFO L206 MainTranslator]: Completed translation [2023-12-19 05:38:32,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32 WrapperNode [2023-12-19 05:38:32,690 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 05:38:32,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 05:38:32,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 05:38:32,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 05:38:32,696 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,705 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,760 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2023-12-19 05:38:32,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 05:38:32,761 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 05:38:32,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 05:38:32,762 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 05:38:32,770 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,773 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,793 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-19 05:38:32,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,810 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,816 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,823 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,828 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 05:38:32,829 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 05:38:32,830 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 05:38:32,830 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 05:38:32,831 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (1/1) ... [2023-12-19 05:38:32,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 05:38:32,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 05:38:32,871 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 05:38:32,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 05:38:32,897 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 05:38:32,897 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 05:38:32,897 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 05:38:32,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 05:38:32,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 05:38:32,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 05:38:32,987 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 05:38:32,988 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 05:38:33,268 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 05:38:33,293 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 05:38:33,293 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 05:38:33,293 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:38:33 BoogieIcfgContainer [2023-12-19 05:38:33,293 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 05:38:33,295 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 05:38:33,295 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 05:38:33,297 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 05:38:33,297 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:38:32" (1/3) ... [2023-12-19 05:38:33,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4bb2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:38:33, skipping insertion in model container [2023-12-19 05:38:33,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:38:32" (2/3) ... [2023-12-19 05:38:33,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d4bb2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:38:33, skipping insertion in model container [2023-12-19 05:38:33,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:38:33" (3/3) ... [2023-12-19 05:38:33,299 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-63.i [2023-12-19 05:38:33,311 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 05:38:33,311 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 05:38:33,354 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 05:38:33,359 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;@3043135c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 05:38:33,359 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 05:38:33,362 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 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-19 05:38:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 05:38:33,376 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:33,377 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, 1, 1, 1] [2023-12-19 05:38:33,377 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:33,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:33,381 INFO L85 PathProgramCache]: Analyzing trace with hash 79170180, now seen corresponding path program 1 times [2023-12-19 05:38:33,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:33,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636122934] [2023-12-19 05:38:33,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:33,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:33,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:38:33,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:38:33,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:38:33,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:38:33,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:38:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:38:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:38:33,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:38:33,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 05:38:33,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 05:38:33,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 05:38:33,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 05:38:33,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 05:38:33,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:33,777 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-19 05:38:33,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:33,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636122934] [2023-12-19 05:38:33,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636122934] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:33,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:33,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 05:38:33,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429059954] [2023-12-19 05:38:33,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:33,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 05:38:33,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:33,809 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 05:38:33,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 05:38:33,811 INFO L87 Difference]: Start difference. First operand has 62 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 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) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-19 05:38:33,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:33,851 INFO L93 Difference]: Finished difference Result 121 states and 206 transitions. [2023-12-19 05:38:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 05:38:33,854 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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 112 [2023-12-19 05:38:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:33,859 INFO L225 Difference]: With dead ends: 121 [2023-12-19 05:38:33,860 INFO L226 Difference]: Without dead ends: 60 [2023-12-19 05:38:33,863 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-19 05:38:33,866 INFO L413 NwaCegarLoop]: 88 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, 88 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-19 05:38:33,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 05:38:33,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-12-19 05:38:33,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-12-19 05:38:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 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-19 05:38:33,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 91 transitions. [2023-12-19 05:38:33,906 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 91 transitions. Word has length 112 [2023-12-19 05:38:33,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:33,906 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 91 transitions. [2023-12-19 05:38:33,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 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-19 05:38:33,907 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 91 transitions. [2023-12-19 05:38:33,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 05:38:33,911 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:33,911 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, 1, 1, 1] [2023-12-19 05:38:33,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-19 05:38:33,912 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:33,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:33,912 INFO L85 PathProgramCache]: Analyzing trace with hash 2059307856, now seen corresponding path program 1 times [2023-12-19 05:38:33,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:33,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143554390] [2023-12-19 05:38:33,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:33,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:33,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:38:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:38:34,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:38:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:38:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:38:34,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:38:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:34,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:34,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:38:34,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:38:34,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 05:38:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 05:38:34,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 05:38:34,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 05:38:34,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 05:38:34,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,199 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-19 05:38:34,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:34,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143554390] [2023-12-19 05:38:34,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143554390] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:34,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:34,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 05:38:34,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211561944] [2023-12-19 05:38:34,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:34,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 05:38:34,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:34,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 05:38:34,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 05:38:34,212 INFO L87 Difference]: Start difference. First operand 60 states and 91 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-19 05:38:34,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:34,269 INFO L93 Difference]: Finished difference Result 143 states and 218 transitions. [2023-12-19 05:38:34,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 05:38:34,270 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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 112 [2023-12-19 05:38:34,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:34,273 INFO L225 Difference]: With dead ends: 143 [2023-12-19 05:38:34,273 INFO L226 Difference]: Without dead ends: 84 [2023-12-19 05:38:34,275 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-19 05:38:34,276 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 28 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:34,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 182 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 05:38:34,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-12-19 05:38:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 71. [2023-12-19 05:38:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 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-19 05:38:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 108 transitions. [2023-12-19 05:38:34,283 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 108 transitions. Word has length 112 [2023-12-19 05:38:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:34,284 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 108 transitions. [2023-12-19 05:38:34,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 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-19 05:38:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 108 transitions. [2023-12-19 05:38:34,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 05:38:34,292 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:34,293 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, 1, 1, 1] [2023-12-19 05:38:34,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-19 05:38:34,293 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:34,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:34,293 INFO L85 PathProgramCache]: Analyzing trace with hash -550108400, now seen corresponding path program 1 times [2023-12-19 05:38:34,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:34,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291958424] [2023-12-19 05:38:34,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:34,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:38:34,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:38:34,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:38:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:38:34,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:38:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:38:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:34,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:34,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:38:34,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:38:34,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 05:38:34,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 05:38:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 05:38:34,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 05:38:34,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 05:38:34,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:34,685 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-19 05:38:34,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:34,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291958424] [2023-12-19 05:38:34,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291958424] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:34,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:34,686 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 05:38:34,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474092161] [2023-12-19 05:38:34,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:34,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 05:38:34,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:34,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 05:38:34,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 05:38:34,689 INFO L87 Difference]: Start difference. First operand 71 states and 108 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-19 05:38:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:34,902 INFO L93 Difference]: Finished difference Result 264 states and 397 transitions. [2023-12-19 05:38:34,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 05:38:34,903 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 112 [2023-12-19 05:38:34,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:34,908 INFO L225 Difference]: With dead ends: 264 [2023-12-19 05:38:34,908 INFO L226 Difference]: Without dead ends: 194 [2023-12-19 05:38:34,911 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-19 05:38:34,913 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 163 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:34,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 335 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 05:38:34,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-12-19 05:38:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 94. [2023-12-19 05:38:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 76 states have internal predecessors, (109), 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-19 05:38:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 141 transitions. [2023-12-19 05:38:34,928 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 141 transitions. Word has length 112 [2023-12-19 05:38:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:34,928 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 141 transitions. [2023-12-19 05:38:34,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-19 05:38:34,929 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 141 transitions. [2023-12-19 05:38:34,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 05:38:34,930 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:34,930 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, 1, 1, 1] [2023-12-19 05:38:34,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-12-19 05:38:34,930 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:34,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:34,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1251172978, now seen corresponding path program 1 times [2023-12-19 05:38:34,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:34,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249372740] [2023-12-19 05:38:34,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:34,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:34,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:35,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:38:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:38:35,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:38:35,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:38:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:38:35,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:38:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:35,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:35,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:38:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:38:35,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 05:38:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 05:38:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 05:38:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 05:38:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 05:38:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,311 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-19 05:38:35,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:35,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249372740] [2023-12-19 05:38:35,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249372740] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:35,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:35,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 05:38:35,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795658247] [2023-12-19 05:38:35,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:35,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 05:38:35,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:35,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 05:38:35,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 05:38:35,314 INFO L87 Difference]: Start difference. First operand 94 states and 141 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-19 05:38:35,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:35,659 INFO L93 Difference]: Finished difference Result 301 states and 443 transitions. [2023-12-19 05:38:35,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 05:38:35,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 112 [2023-12-19 05:38:35,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:35,663 INFO L225 Difference]: With dead ends: 301 [2023-12-19 05:38:35,663 INFO L226 Difference]: Without dead ends: 208 [2023-12-19 05:38:35,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 05:38:35,670 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 197 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:35,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 418 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 05:38:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2023-12-19 05:38:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 94. [2023-12-19 05:38:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 76 states have (on average 1.394736842105263) internal successors, (106), 76 states have internal predecessors, (106), 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-19 05:38:35,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 138 transitions. [2023-12-19 05:38:35,679 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 138 transitions. Word has length 112 [2023-12-19 05:38:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:35,679 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 138 transitions. [2023-12-19 05:38:35,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-19 05:38:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 138 transitions. [2023-12-19 05:38:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 05:38:35,680 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:35,680 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, 1, 1, 1] [2023-12-19 05:38:35,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-12-19 05:38:35,680 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:35,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:35,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1561225650, now seen corresponding path program 1 times [2023-12-19 05:38:35,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:35,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473431141] [2023-12-19 05:38:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:35,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:35,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:38:35,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:38:35,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:38:35,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:38:35,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:38:35,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:38:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:35,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:38:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:38:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 05:38:35,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 05:38:35,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 05:38:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 05:38:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 05:38:35,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:35,837 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-19 05:38:35,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:35,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473431141] [2023-12-19 05:38:35,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473431141] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:35,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:35,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 05:38:35,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18481030] [2023-12-19 05:38:35,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:35,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 05:38:35,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:35,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 05:38:35,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 05:38:35,839 INFO L87 Difference]: Start difference. First operand 94 states and 138 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-19 05:38:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:35,965 INFO L93 Difference]: Finished difference Result 284 states and 416 transitions. [2023-12-19 05:38:35,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 05:38:35,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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 112 [2023-12-19 05:38:35,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:35,967 INFO L225 Difference]: With dead ends: 284 [2023-12-19 05:38:35,967 INFO L226 Difference]: Without dead ends: 191 [2023-12-19 05:38:35,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-19 05:38:35,967 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 107 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:35,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 209 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 05:38:35,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2023-12-19 05:38:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 101. [2023-12-19 05:38:35,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 83 states have (on average 1.3734939759036144) internal successors, (114), 83 states have internal predecessors, (114), 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-19 05:38:35,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 146 transitions. [2023-12-19 05:38:35,974 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 146 transitions. Word has length 112 [2023-12-19 05:38:35,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:35,974 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 146 transitions. [2023-12-19 05:38:35,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 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-19 05:38:35,975 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 146 transitions. [2023-12-19 05:38:35,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-12-19 05:38:35,975 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:35,975 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, 1, 1, 1] [2023-12-19 05:38:35,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-12-19 05:38:35,976 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:35,976 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:35,976 INFO L85 PathProgramCache]: Analyzing trace with hash 2032677068, now seen corresponding path program 1 times [2023-12-19 05:38:35,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:35,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895775562] [2023-12-19 05:38:35,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:35,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:36,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:38:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:38:36,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:38:36,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:38:36,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:38:36,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:38:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:36,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:36,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:38:36,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:38:36,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 05:38:36,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 05:38:36,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 05:38:36,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 05:38:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 05:38:36,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,371 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-19 05:38:36,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:36,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895775562] [2023-12-19 05:38:36,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895775562] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:36,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:36,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 05:38:36,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375245703] [2023-12-19 05:38:36,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:36,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 05:38:36,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:36,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 05:38:36,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-12-19 05:38:36,373 INFO L87 Difference]: Start difference. First operand 101 states and 146 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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-19 05:38:36,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:36,793 INFO L93 Difference]: Finished difference Result 293 states and 425 transitions. [2023-12-19 05:38:36,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-19 05:38:36,793 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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 112 [2023-12-19 05:38:36,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:36,795 INFO L225 Difference]: With dead ends: 293 [2023-12-19 05:38:36,795 INFO L226 Difference]: Without dead ends: 193 [2023-12-19 05:38:36,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2023-12-19 05:38:36,796 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 172 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:36,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 634 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 05:38:36,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-19 05:38:36,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 108. [2023-12-19 05:38:36,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 90 states have (on average 1.3777777777777778) internal successors, (124), 90 states have internal predecessors, (124), 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-19 05:38:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2023-12-19 05:38:36,802 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 112 [2023-12-19 05:38:36,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:36,802 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2023-12-19 05:38:36,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 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-19 05:38:36,802 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2023-12-19 05:38:36,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 05:38:36,803 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:36,803 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, 1, 1, 1, 1] [2023-12-19 05:38:36,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-12-19 05:38:36,804 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:36,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:36,804 INFO L85 PathProgramCache]: Analyzing trace with hash 293208226, now seen corresponding path program 1 times [2023-12-19 05:38:36,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:36,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145348964] [2023-12-19 05:38:36,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:36,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:36,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:36,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:38:36,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:38:36,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:38:36,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:38:36,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:38:36,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:38:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:36,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:36,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:38:36,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:38:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 05:38:36,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 05:38:36,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 05:38:36,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 05:38:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 05:38:36,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:36,878 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-19 05:38:36,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:36,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145348964] [2023-12-19 05:38:36,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145348964] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:36,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:36,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 05:38:36,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317186641] [2023-12-19 05:38:36,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:36,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 05:38:36,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:36,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 05:38:36,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 05:38:36,880 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-19 05:38:36,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:36,915 INFO L93 Difference]: Finished difference Result 261 states and 377 transitions. [2023-12-19 05:38:36,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 05:38:36,916 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 113 [2023-12-19 05:38:36,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:36,917 INFO L225 Difference]: With dead ends: 261 [2023-12-19 05:38:36,917 INFO L226 Difference]: Without dead ends: 154 [2023-12-19 05:38:36,917 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-19 05:38:36,918 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 64 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:36,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 209 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 05:38:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-12-19 05:38:36,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 111. [2023-12-19 05:38:36,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 93 states have internal predecessors, (127), 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-19 05:38:36,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2023-12-19 05:38:36,923 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 113 [2023-12-19 05:38:36,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:36,923 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2023-12-19 05:38:36,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-19 05:38:36,924 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2023-12-19 05:38:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 05:38:36,924 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:36,924 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, 1, 1, 1, 1] [2023-12-19 05:38:36,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-12-19 05:38:36,925 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:36,925 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:36,925 INFO L85 PathProgramCache]: Analyzing trace with hash -2045962614, now seen corresponding path program 1 times [2023-12-19 05:38:36,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:36,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582131937] [2023-12-19 05:38:36,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:36,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:38:37,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:38:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:38:37,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:38:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:38:37,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:38:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:37,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:37,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:38:37,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:38:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 05:38:37,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 05:38:37,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 05:38:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 05:38:37,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 05:38:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,196 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-19 05:38:37,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:37,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582131937] [2023-12-19 05:38:37,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1582131937] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:37,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:37,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-19 05:38:37,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915604483] [2023-12-19 05:38:37,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:37,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 05:38:37,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:37,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 05:38:37,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 05:38:37,198 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-19 05:38:37,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:37,418 INFO L93 Difference]: Finished difference Result 362 states and 522 transitions. [2023-12-19 05:38:37,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-19 05:38:37,419 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 113 [2023-12-19 05:38:37,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:37,420 INFO L225 Difference]: With dead ends: 362 [2023-12-19 05:38:37,420 INFO L226 Difference]: Without dead ends: 252 [2023-12-19 05:38:37,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-19 05:38:37,421 INFO L413 NwaCegarLoop]: 123 mSDtfsCounter, 110 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:37,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 294 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 05:38:37,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-12-19 05:38:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 210. [2023-12-19 05:38:37,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 175 states have (on average 1.3542857142857143) internal successors, (237), 175 states have internal predecessors, (237), 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-19 05:38:37,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 301 transitions. [2023-12-19 05:38:37,433 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 301 transitions. Word has length 113 [2023-12-19 05:38:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:37,433 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 301 transitions. [2023-12-19 05:38:37,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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-19 05:38:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 301 transitions. [2023-12-19 05:38:37,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 05:38:37,434 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:37,435 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, 1, 1, 1, 1] [2023-12-19 05:38:37,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-12-19 05:38:37,435 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:37,435 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:37,435 INFO L85 PathProgramCache]: Analyzing trace with hash -988372891, now seen corresponding path program 1 times [2023-12-19 05:38:37,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:37,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048851719] [2023-12-19 05:38:37,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:37,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:38:37,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:38:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:38:37,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:38:37,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:38:37,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:38:37,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:38:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:38:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 05:38:37,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 05:38:37,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 05:38:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 05:38:37,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 05:38:37,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,505 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-19 05:38:37,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:37,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048851719] [2023-12-19 05:38:37,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048851719] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:37,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:37,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 05:38:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696524094] [2023-12-19 05:38:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:37,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 05:38:37,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:37,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 05:38:37,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 05:38:37,506 INFO L87 Difference]: Start difference. First operand 210 states and 301 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-19 05:38:37,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:37,573 INFO L93 Difference]: Finished difference Result 501 states and 719 transitions. [2023-12-19 05:38:37,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 05:38:37,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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 113 [2023-12-19 05:38:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:37,575 INFO L225 Difference]: With dead ends: 501 [2023-12-19 05:38:37,575 INFO L226 Difference]: Without dead ends: 292 [2023-12-19 05:38:37,576 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-19 05:38:37,576 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 67 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:37,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 171 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 05:38:37,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-12-19 05:38:37,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 210. [2023-12-19 05:38:37,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 175 states have (on average 1.3428571428571427) internal successors, (235), 175 states have internal predecessors, (235), 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-19 05:38:37,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 299 transitions. [2023-12-19 05:38:37,591 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 299 transitions. Word has length 113 [2023-12-19 05:38:37,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:37,592 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 299 transitions. [2023-12-19 05:38:37,592 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 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-19 05:38:37,592 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 299 transitions. [2023-12-19 05:38:37,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-19 05:38:37,593 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:37,593 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, 1, 1, 1, 1] [2023-12-19 05:38:37,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-12-19 05:38:37,593 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:37,593 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:37,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1228314164, now seen corresponding path program 1 times [2023-12-19 05:38:37,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:37,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913633398] [2023-12-19 05:38:37,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:37,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:37,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:38:37,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:38:37,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:38:37,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:38:37,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:38:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:38:37,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:37,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:37,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:38:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:38:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 05:38:37,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 05:38:37,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 05:38:37,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 05:38:37,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 05:38:37,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:37,911 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-19 05:38:37,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:37,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913633398] [2023-12-19 05:38:37,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913633398] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:37,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:37,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 05:38:37,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785079338] [2023-12-19 05:38:37,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:37,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 05:38:37,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:37,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 05:38:37,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-19 05:38:37,913 INFO L87 Difference]: Start difference. First operand 210 states and 299 transitions. Second operand has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-19 05:38:38,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:38,231 INFO L93 Difference]: Finished difference Result 520 states and 722 transitions. [2023-12-19 05:38:38,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-19 05:38:38,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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 113 [2023-12-19 05:38:38,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:38,233 INFO L225 Difference]: With dead ends: 520 [2023-12-19 05:38:38,233 INFO L226 Difference]: Without dead ends: 311 [2023-12-19 05:38:38,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2023-12-19 05:38:38,234 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 76 mSDsluCounter, 471 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:38,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 567 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 05:38:38,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2023-12-19 05:38:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 208. [2023-12-19 05:38:38,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 173 states have (on average 1.277456647398844) internal successors, (221), 173 states have internal predecessors, (221), 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-19 05:38:38,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 285 transitions. [2023-12-19 05:38:38,249 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 285 transitions. Word has length 113 [2023-12-19 05:38:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:38,249 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 285 transitions. [2023-12-19 05:38:38,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.0) internal successors, (36), 9 states have internal predecessors, (36), 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-19 05:38:38,249 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 285 transitions. [2023-12-19 05:38:38,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 05:38:38,250 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:38,250 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, 1, 1, 1, 1, 1] [2023-12-19 05:38:38,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-12-19 05:38:38,250 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:38,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:38,251 INFO L85 PathProgramCache]: Analyzing trace with hash 2093750061, now seen corresponding path program 1 times [2023-12-19 05:38:38,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:38,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46490605] [2023-12-19 05:38:38,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:38,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:38,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:38:38,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:38:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:38:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:38:38,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:38:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:38:38,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:38,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:38:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:38:38,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 05:38:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 05:38:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 05:38:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 05:38:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 05:38:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:38,606 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-19 05:38:38,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:38,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46490605] [2023-12-19 05:38:38,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46490605] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:38,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:38,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-12-19 05:38:38,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446271746] [2023-12-19 05:38:38,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:38,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-19 05:38:38,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:38,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-19 05:38:38,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-19 05:38:38,608 INFO L87 Difference]: Start difference. First operand 208 states and 285 transitions. Second operand has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-19 05:38:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:39,102 INFO L93 Difference]: Finished difference Result 509 states and 700 transitions. [2023-12-19 05:38:39,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-19 05:38:39,103 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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 114 [2023-12-19 05:38:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:39,104 INFO L225 Difference]: With dead ends: 509 [2023-12-19 05:38:39,104 INFO L226 Difference]: Without dead ends: 302 [2023-12-19 05:38:39,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2023-12-19 05:38:39,105 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 176 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:39,106 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 632 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-19 05:38:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2023-12-19 05:38:39,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 211. [2023-12-19 05:38:39,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 176 states have (on average 1.2727272727272727) internal successors, (224), 176 states have internal predecessors, (224), 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-19 05:38:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 288 transitions. [2023-12-19 05:38:39,123 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 288 transitions. Word has length 114 [2023-12-19 05:38:39,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:39,123 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 288 transitions. [2023-12-19 05:38:39,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.111111111111111) internal successors, (37), 9 states have internal predecessors, (37), 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-19 05:38:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 288 transitions. [2023-12-19 05:38:39,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 05:38:39,124 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:39,125 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, 1, 1, 1, 1, 1] [2023-12-19 05:38:39,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-12-19 05:38:39,125 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:39,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:39,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1132744399, now seen corresponding path program 1 times [2023-12-19 05:38:39,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:39,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140899245] [2023-12-19 05:38:39,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:39,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-12-19 05:38:39,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-12-19 05:38:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-12-19 05:38:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-12-19 05:38:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-12-19 05:38:39,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-12-19 05:38:39,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-12-19 05:38:39,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-12-19 05:38:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-12-19 05:38:39,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-12-19 05:38:39,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-12-19 05:38:39,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-12-19 05:38:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-12-19 05:38:39,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-12-19 05:38:39,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-12-19 05:38:39,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-12-19 05:38:39,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 05:38:39,209 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-19 05:38:39,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 05:38:39,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140899245] [2023-12-19 05:38:39,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140899245] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 05:38:39,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 05:38:39,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 05:38:39,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277249832] [2023-12-19 05:38:39,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 05:38:39,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-19 05:38:39,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 05:38:39,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-19 05:38:39,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-19 05:38:39,210 INFO L87 Difference]: Start difference. First operand 211 states and 288 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-19 05:38:39,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 05:38:39,263 INFO L93 Difference]: Finished difference Result 509 states and 698 transitions. [2023-12-19 05:38:39,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-19 05:38:39,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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 114 [2023-12-19 05:38:39,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 05:38:39,265 INFO L225 Difference]: With dead ends: 509 [2023-12-19 05:38:39,265 INFO L226 Difference]: Without dead ends: 299 [2023-12-19 05:38:39,266 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-19 05:38:39,266 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 76 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 05:38:39,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 161 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 05:38:39,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-19 05:38:39,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 211. [2023-12-19 05:38:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 176 states have (on average 1.2613636363636365) internal successors, (222), 176 states have internal predecessors, (222), 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-19 05:38:39,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 286 transitions. [2023-12-19 05:38:39,287 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 286 transitions. Word has length 114 [2023-12-19 05:38:39,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 05:38:39,288 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 286 transitions. [2023-12-19 05:38:39,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 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-19 05:38:39,288 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 286 transitions. [2023-12-19 05:38:39,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2023-12-19 05:38:39,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 05:38:39,289 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, 1, 1, 1, 1, 1] [2023-12-19 05:38:39,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-12-19 05:38:39,289 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 05:38:39,289 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 05:38:39,289 INFO L85 PathProgramCache]: Analyzing trace with hash -1130897357, now seen corresponding path program 1 times [2023-12-19 05:38:39,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 05:38:39,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391200406] [2023-12-19 05:38:39,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 05:38:39,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 05:38:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 05:38:39,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 05:38:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 05:38:39,408 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 05:38:39,408 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 05:38:39,409 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 05:38:39,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-12-19 05:38:39,412 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 05:38:39,415 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 05:38:39,490 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:38:39 BoogieIcfgContainer [2023-12-19 05:38:39,490 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 05:38:39,491 INFO L158 Benchmark]: Toolchain (without parser) took 7036.74ms. Allocated memory was 294.6MB in the beginning and 380.6MB in the end (delta: 86.0MB). Free memory was 256.5MB in the beginning and 266.8MB in the end (delta: -10.3MB). Peak memory consumption was 75.0MB. Max. memory is 8.0GB. [2023-12-19 05:38:39,491 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 05:38:39,491 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.98ms. Allocated memory is still 294.6MB. Free memory was 256.5MB in the beginning and 242.2MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-19 05:38:39,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.06ms. Allocated memory is still 294.6MB. Free memory was 241.8MB in the beginning and 238.3MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-19 05:38:39,491 INFO L158 Benchmark]: Boogie Preprocessor took 67.17ms. Allocated memory is still 294.6MB. Free memory was 238.3MB in the beginning and 233.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-19 05:38:39,492 INFO L158 Benchmark]: RCFGBuilder took 463.99ms. Allocated memory is still 294.6MB. Free memory was 233.1MB in the beginning and 209.6MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. [2023-12-19 05:38:39,492 INFO L158 Benchmark]: TraceAbstraction took 6195.29ms. Allocated memory was 294.6MB in the beginning and 380.6MB in the end (delta: 86.0MB). Free memory was 208.6MB in the beginning and 266.8MB in the end (delta: -58.1MB). Peak memory consumption was 27.8MB. Max. memory is 8.0GB. [2023-12-19 05:38:39,493 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 173.0MB. Free memory is still 124.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 233.98ms. Allocated memory is still 294.6MB. Free memory was 256.5MB in the beginning and 242.2MB in the end (delta: 14.3MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 70.06ms. Allocated memory is still 294.6MB. Free memory was 241.8MB in the beginning and 238.3MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 67.17ms. Allocated memory is still 294.6MB. Free memory was 238.3MB in the beginning and 233.1MB in the end (delta: 5.2MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 463.99ms. Allocated memory is still 294.6MB. Free memory was 233.1MB in the beginning and 209.6MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 8.0GB. * TraceAbstraction took 6195.29ms. Allocated memory was 294.6MB in the beginning and 380.6MB in the end (delta: 86.0MB). Free memory was 208.6MB in the beginning and 266.8MB in the end (delta: -58.1MB). Peak memory consumption was 27.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 121, overapproximation of someBinaryFLOATComparisonOperation at line 121, overapproximation of shiftRight at line 121. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 64; [L23] unsigned char var_1_7 = 0; [L24] unsigned short int var_1_11 = 500; [L25] unsigned char var_1_13 = 64; [L26] unsigned char var_1_15 = 1; [L27] unsigned char var_1_16 = 8; [L28] double var_1_17 = 7.5; [L29] double var_1_18 = 31.125; [L30] double var_1_19 = 10.5; [L31] double var_1_20 = 0.0; [L32] double var_1_21 = 16.75; [L33] double var_1_22 = 2.5; [L34] double var_1_23 = 64.5; [L35] signed long int var_1_24 = 10; [L36] signed char var_1_26 = 16; [L37] signed char var_1_27 = 4; [L38] signed char var_1_28 = -10; [L39] float var_1_29 = 63.794; [L40] unsigned short int var_1_30 = 1; [L41] signed long int var_1_31 = -2; [L42] unsigned char var_1_32 = 64; [L43] signed long int last_1_var_1_1 = 64; [L44] unsigned char last_1_var_1_13 = 64; [L125] isInitial = 1 [L126] FCALL initially() [L127] COND TRUE 1 [L128] CALL updateLastVariables() [L117] last_1_var_1_1 = var_1_1 [L118] last_1_var_1_13 = var_1_13 [L128] RET updateLastVariables() [L129] CALL updateVariables() [L88] var_1_7 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L89] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64] [L90] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L90] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=1, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L91] var_1_15 = __VERIFIER_nondet_uchar() [L92] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L92] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] CALL assume_abort_if_not(var_1_15 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L93] RET assume_abort_if_not(var_1_15 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=8, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L94] var_1_16 = __VERIFIER_nondet_uchar() [L95] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L95] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L96] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_18=249/8, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L97] var_1_18 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L98] RET assume_abort_if_not((var_1_18 >= 0.0F && var_1_18 <= -1.0e-20F) || (var_1_18 <= 4611686.018427382800e+12F && var_1_18 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_19=21/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L99] var_1_19 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L100] RET assume_abort_if_not((var_1_19 >= 0.0F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_20=0, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L101] var_1_20 = __VERIFIER_nondet_double() [L102] CALL assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L102] RET assume_abort_if_not((var_1_20 >= 4611686.018427382800e+12F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_21=67/4, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L103] var_1_21 = __VERIFIER_nondet_double() [L104] CALL assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L104] RET assume_abort_if_not((var_1_21 >= 0.0F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_22=5/2, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L105] var_1_22 = __VERIFIER_nondet_double() [L106] CALL assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L106] RET assume_abort_if_not((var_1_22 >= -922337.2036854765600e+13F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 9223372.036854765600e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_23=129/2, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L107] var_1_23 = __VERIFIER_nondet_double() [L108] CALL assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L108] RET assume_abort_if_not((var_1_23 >= -922337.2036854765600e+13F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 9223372.036854765600e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=4, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L109] var_1_27 = __VERIFIER_nondet_char() [L110] CALL assume_abort_if_not(var_1_27 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L110] RET assume_abort_if_not(var_1_27 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] CALL assume_abort_if_not(var_1_27 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L111] RET assume_abort_if_not(var_1_27 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-10, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L112] var_1_28 = __VERIFIER_nondet_char() [L113] CALL assume_abort_if_not(var_1_28 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L113] RET assume_abort_if_not(var_1_28 >= -63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] CALL assume_abort_if_not(var_1_28 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L114] RET assume_abort_if_not(var_1_28 <= 63) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L129] RET updateVariables() [L130] CALL step() [L48] COND FALSE !(last_1_var_1_1 != last_1_var_1_13) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=-2, var_1_32=64, var_1_7=0] [L51] var_1_31 = var_1_13 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=15/2, var_1_1=64, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L52] COND FALSE !(\read(var_1_7)) [L55] var_1_17 = var_1_22 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L57] COND FALSE !(\read(var_1_7)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=64, var_1_7=0] [L60] var_1_32 = var_1_16 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=68, var_1_7=0] [L61] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=500, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=68, var_1_7=0] [L61] COND TRUE (var_1_32 >> var_1_32) < var_1_13 [L62] var_1_11 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=1, var_1_31=64, var_1_32=68, var_1_7=0] [L64] var_1_30 = var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=16, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L65] COND TRUE var_1_11 >= var_1_30 [L66] var_1_26 = (var_1_27 + var_1_28) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=10, var_1_26=-68, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L68] COND TRUE ! var_1_7 [L69] var_1_24 = (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=-68, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L77] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=64, var_1_22=505, var_1_24=0, var_1_26=-68, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L77] COND TRUE 32u < ((var_1_31 + 4u) | var_1_30) [L78] var_1_1 = (var_1_26 + (var_1_26 + var_1_32)) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-68, var_1_22=505, var_1_24=0, var_1_26=-68, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L130] RET step() [L131] CALL, EXPR property() [L121] EXPR (var_1_31 + 4u) | var_1_30 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-68, var_1_22=505, var_1_24=0, var_1_26=-68, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L121] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-68, var_1_22=505, var_1_24=0, var_1_26=-68, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L121] EXPR var_1_32 >> var_1_32 VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-68, var_1_22=505, var_1_24=0, var_1_26=-68, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L121] EXPR ((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1) VAL [isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-68, var_1_22=505, var_1_24=0, var_1_26=-68, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L121-L122] return ((((((((((32u < ((var_1_31 + 4u) | var_1_30)) ? (var_1_1 == ((signed long int) (var_1_26 + (var_1_26 + var_1_32)))) : ((! var_1_7) ? (var_1_1 == ((signed long int) ((((var_1_26) < ((var_1_11 - var_1_32))) ? (var_1_26) : ((var_1_11 - var_1_32)))))) : (var_1_1 == ((signed long int) (var_1_32 - var_1_13))))) && (((var_1_32 >> var_1_32) < var_1_13) ? (var_1_11 == ((unsigned short int) var_1_32)) : 1)) && ((last_1_var_1_1 != last_1_var_1_13) ? (var_1_13 == ((unsigned char) ((((var_1_15) < (var_1_16)) ? (var_1_15) : (var_1_16))))) : 1)) && (var_1_7 ? (var_1_17 == ((double) ((((((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) < (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23))))) ? (((var_1_18 + var_1_19) - (var_1_20 - var_1_21))) : (((((var_1_22) > (var_1_23)) ? (var_1_22) : (var_1_23)))))))) : (var_1_17 == ((double) var_1_22)))) && ((! var_1_7) ? (var_1_24 == ((signed long int) (var_1_11 - ((((((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) < ((var_1_30 + var_1_15))) ? (((((var_1_30) > (var_1_13)) ? (var_1_30) : (var_1_13)))) : ((var_1_30 + var_1_15))))))) : ((var_1_11 < var_1_30) ? (var_1_24 == ((signed long int) -4)) : (var_1_24 == ((signed long int) var_1_26))))) && ((var_1_11 >= var_1_30) ? (var_1_26 == ((signed char) (var_1_27 + var_1_28))) : 1)) && (var_1_7 ? (var_1_29 == ((float) var_1_20)) : 1)) && (var_1_30 == ((unsigned short int) var_1_32))) && (var_1_31 == ((signed long int) var_1_13))) && (var_1_32 == ((unsigned char) var_1_16)) ; [L131] RET, EXPR property() [L131] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-68, var_1_22=505, var_1_24=0, var_1_26=-68, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] [L19] reach_error() VAL [\old(cond)=0, cond=0, isInitial=1, last_1_var_1_13=64, last_1_var_1_1=64, var_1_11=68, var_1_13=64, var_1_15=254, var_1_16=68, var_1_17=505, var_1_1=-68, var_1_22=505, var_1_24=0, var_1_26=-68, var_1_27=-63, var_1_28=-5, var_1_29=31897/500, var_1_30=68, var_1_31=64, var_1_32=68, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 13, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1236 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1236 mSDsluCounter, 3900 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2533 mSDsCounter, 430 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1493 IncrementalHoareTripleChecker+Invalid, 1923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 430 mSolverCounterUnsat, 1367 mSDtfsCounter, 1493 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 505 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=11, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 851 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1466 NumberOfCodeBlocks, 1466 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1340 ConstructedInterpolants, 0 QuantifiedInterpolants, 3447 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 5760/5760 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-12-19 05:38:39,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...