./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:09:37,616 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:09:37,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 12:09:37,657 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:09:37,657 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:09:37,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:09:37,672 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:09:37,672 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:09:37,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:09:37,673 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:09:37,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:09:37,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:09:37,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:09:37,675 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:09:37,675 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:09:37,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:09:37,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:09:37,676 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:09:37,676 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 12:09:37,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:09:37,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:09:37,677 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:09:37,677 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:09:37,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:09:37,678 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:09:37,678 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:09:37,678 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:09:37,678 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:09:37,679 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:09:37,679 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:09:37,679 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:09:37,679 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:09:37,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:09:37,680 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:09:37,680 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:09:37,680 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:09:37,680 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 12:09:37,680 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 12:09:37,681 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:09:37,681 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:09:37,681 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:09:37,681 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:09:37,682 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 [2024-11-16 12:09:37,902 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:09:37,923 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:09:37,927 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:09:37,932 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:09:37,932 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:09:37,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2024-11-16 12:09:39,268 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:09:39,429 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:09:39,429 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2024-11-16 12:09:39,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4f5e616/4408ab7d788c40a48f14b8d5c4805e20/FLAG11a4d59c3 [2024-11-16 12:09:39,452 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af4f5e616/4408ab7d788c40a48f14b8d5c4805e20 [2024-11-16 12:09:39,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:09:39,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:09:39,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:09:39,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:09:39,465 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:09:39,466 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,466 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bdaf23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39, skipping insertion in model container [2024-11-16 12:09:39,466 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,489 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:09:39,616 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i[918,931] [2024-11-16 12:09:39,656 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:09:39,667 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:09:39,676 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i[918,931] [2024-11-16 12:09:39,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:09:39,707 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:09:39,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39 WrapperNode [2024-11-16 12:09:39,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:09:39,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:09:39,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:09:39,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:09:39,713 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,719 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,746 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 171 [2024-11-16 12:09:39,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:09:39,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:09:39,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:09:39,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:09:39,763 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,764 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,766 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,783 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]. [2024-11-16 12:09:39,783 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,783 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,789 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,790 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,791 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,795 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:09:39,795 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:09:39,795 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:09:39,796 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:09:39,796 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (1/1) ... [2024-11-16 12:09:39,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:09:39,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:09:39,835 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) [2024-11-16 12:09:39,841 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 [2024-11-16 12:09:39,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:09:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:09:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:09:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 12:09:39,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:09:39,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:09:39,987 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:09:39,990 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:09:40,259 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L114: havoc property_#t~bitwise15#1;havoc property_#t~ite17#1;havoc property_#t~bitwise16#1;havoc property_#t~bitwise18#1;havoc property_#t~short19#1; [2024-11-16 12:09:40,281 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 12:09:40,281 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:09:40,301 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:09:40,302 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:09:40,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:09:40 BoogieIcfgContainer [2024-11-16 12:09:40,302 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:09:40,304 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:09:40,304 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:09:40,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:09:40,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:09:39" (1/3) ... [2024-11-16 12:09:40,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5505185b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:09:40, skipping insertion in model container [2024-11-16 12:09:40,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:09:39" (2/3) ... [2024-11-16 12:09:40,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5505185b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:09:40, skipping insertion in model container [2024-11-16 12:09:40,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:09:40" (3/3) ... [2024-11-16 12:09:40,308 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-9.i [2024-11-16 12:09:40,319 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:09:40,319 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:09:40,364 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:09:40,373 INFO L333 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, 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;@7d51a6b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:09:40,374 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:09:40,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:09:40,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 12:09:40,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:09:40,390 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:09:40,390 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:09:40,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:09:40,396 INFO L85 PathProgramCache]: Analyzing trace with hash -1347328808, now seen corresponding path program 1 times [2024-11-16 12:09:40,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:09:40,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726351876] [2024-11-16 12:09:40,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:09:40,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:09:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:09:40,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:09:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:09:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:09:40,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:09:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:09:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:09:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:09:40,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:09:40,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:09:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:09:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:09:40,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:09:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:09:40,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:09:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:09:40,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:09:40,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726351876] [2024-11-16 12:09:40,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726351876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:09:40,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:09:40,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:09:40,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617208864] [2024-11-16 12:09:40,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:09:40,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:09:40,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:09:40,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:09:40,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:09:40,748 INFO L87 Difference]: Start difference. First operand has 74 states, 56 states have (on average 1.4107142857142858) internal successors, (79), 57 states have internal predecessors, (79), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:09:40,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:09:40,778 INFO L93 Difference]: Finished difference Result 140 states and 226 transitions. [2024-11-16 12:09:40,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:09:40,781 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 107 [2024-11-16 12:09:40,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:09:40,788 INFO L225 Difference]: With dead ends: 140 [2024-11-16 12:09:40,788 INFO L226 Difference]: Without dead ends: 69 [2024-11-16 12:09:40,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:09:40,794 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:09:40,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:09:40,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-16 12:09:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-16 12:09:40,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 52 states have (on average 1.3653846153846154) internal successors, (71), 52 states have internal predecessors, (71), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:09:40,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 101 transitions. [2024-11-16 12:09:40,831 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 101 transitions. Word has length 107 [2024-11-16 12:09:40,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:09:40,832 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 101 transitions. [2024-11-16 12:09:40,832 INFO L472 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:09:40,833 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 101 transitions. [2024-11-16 12:09:40,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-16 12:09:40,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:09:40,837 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:09:40,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 12:09:40,837 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:09:40,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:09:40,838 INFO L85 PathProgramCache]: Analyzing trace with hash 777218549, now seen corresponding path program 1 times [2024-11-16 12:09:40,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:09:40,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444861527] [2024-11-16 12:09:40,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:09:40,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:09:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:09:41,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:09:41,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:09:41,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:09:41,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:09:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:09:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:09:41,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:09:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:09:41,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:09:41,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:09:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:09:41,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:09:41,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:09:41,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:09:41,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:09:41,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:09:41,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444861527] [2024-11-16 12:09:41,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444861527] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:09:41,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:09:41,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:09:41,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395459376] [2024-11-16 12:09:41,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:09:41,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:09:41,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:09:41,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:09:41,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:09:41,116 INFO L87 Difference]: Start difference. First operand 69 states and 101 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:09:41,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:09:41,148 INFO L93 Difference]: Finished difference Result 136 states and 201 transitions. [2024-11-16 12:09:41,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:09:41,149 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 107 [2024-11-16 12:09:41,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:09:41,150 INFO L225 Difference]: With dead ends: 136 [2024-11-16 12:09:41,150 INFO L226 Difference]: Without dead ends: 70 [2024-11-16 12:09:41,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:09:41,155 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:09:41,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 184 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:09:41,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-16 12:09:41,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-16 12:09:41,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:09:41,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-11-16 12:09:41,170 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 107 [2024-11-16 12:09:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:09:41,172 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-11-16 12:09:41,172 INFO L472 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:09:41,173 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-11-16 12:09:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 12:09:41,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:09:41,175 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:09:41,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 12:09:41,176 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:09:41,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:09:41,177 INFO L85 PathProgramCache]: Analyzing trace with hash -1343716205, now seen corresponding path program 1 times [2024-11-16 12:09:41,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:09:41,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481676467] [2024-11-16 12:09:41,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:09:41,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:09:41,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:09:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:09:44,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:09:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:09:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:09:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:09:44,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:09:44,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:09:44,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:09:44,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:09:44,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:09:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:09:44,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:09:44,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:09:44,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:09:44,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:44,533 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:09:44,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:09:44,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481676467] [2024-11-16 12:09:44,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481676467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:09:44,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:09:44,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 12:09:44,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231052078] [2024-11-16 12:09:44,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:09:44,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 12:09:44,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:09:44,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 12:09:44,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:09:44,539 INFO L87 Difference]: Start difference. First operand 70 states and 102 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:09:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:09:47,685 INFO L93 Difference]: Finished difference Result 245 states and 356 transitions. [2024-11-16 12:09:47,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 12:09:47,685 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-16 12:09:47,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:09:47,687 INFO L225 Difference]: With dead ends: 245 [2024-11-16 12:09:47,687 INFO L226 Difference]: Without dead ends: 178 [2024-11-16 12:09:47,688 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2024-11-16 12:09:47,688 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 704 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 704 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:09:47,689 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [704 Valid, 257 Invalid, 351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-16 12:09:47,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-16 12:09:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 93. [2024-11-16 12:09:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 76 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:09:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2024-11-16 12:09:47,711 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 108 [2024-11-16 12:09:47,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:09:47,712 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2024-11-16 12:09:47,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:09:47,712 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2024-11-16 12:09:47,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 12:09:47,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:09:47,715 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:09:47,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 12:09:47,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:09:47,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:09:47,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1849274830, now seen corresponding path program 1 times [2024-11-16 12:09:47,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:09:47,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283863155] [2024-11-16 12:09:47,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:09:47,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:09:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:09:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:09:49,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:09:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:09:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:09:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:09:49,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:09:49,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:09:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:09:49,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:09:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:09:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:09:49,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:09:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:09:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:09:49,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:49,181 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:09:49,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:09:49,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283863155] [2024-11-16 12:09:49,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283863155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:09:49,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:09:49,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 12:09:49,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385879910] [2024-11-16 12:09:49,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:09:49,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:09:49,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:09:49,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:09:49,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:09:49,184 INFO L87 Difference]: Start difference. First operand 93 states and 139 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:09:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:09:49,752 INFO L93 Difference]: Finished difference Result 253 states and 375 transitions. [2024-11-16 12:09:49,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:09:49,753 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-16 12:09:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:09:49,754 INFO L225 Difference]: With dead ends: 253 [2024-11-16 12:09:49,754 INFO L226 Difference]: Without dead ends: 163 [2024-11-16 12:09:49,755 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-16 12:09:49,756 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 139 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:09:49,756 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 447 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:09:49,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2024-11-16 12:09:49,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 93. [2024-11-16 12:09:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 76 states have internal predecessors, (109), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:09:49,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 139 transitions. [2024-11-16 12:09:49,764 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 139 transitions. Word has length 108 [2024-11-16 12:09:49,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:09:49,766 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 139 transitions. [2024-11-16 12:09:49,766 INFO L472 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:09:49,766 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 139 transitions. [2024-11-16 12:09:49,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 12:09:49,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:09:49,767 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:09:49,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 12:09:49,768 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:09:49,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:09:49,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1954178738, now seen corresponding path program 1 times [2024-11-16 12:09:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:09:49,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888095599] [2024-11-16 12:09:49,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:09:49,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:09:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:09:51,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:09:51,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:09:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:09:51,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:09:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:09:51,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:09:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:09:51,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:09:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:09:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:09:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:09:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:09:51,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:09:51,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:09:51,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:09:51,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:09:51,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888095599] [2024-11-16 12:09:51,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888095599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:09:51,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:09:51,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 12:09:51,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41932925] [2024-11-16 12:09:51,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:09:51,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:09:51,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:09:51,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:09:51,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:09:51,538 INFO L87 Difference]: Start difference. First operand 93 states and 139 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:09:55,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:09:55,047 INFO L93 Difference]: Finished difference Result 274 states and 398 transitions. [2024-11-16 12:09:55,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 12:09:55,047 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 108 [2024-11-16 12:09:55,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:09:55,049 INFO L225 Difference]: With dead ends: 274 [2024-11-16 12:09:55,049 INFO L226 Difference]: Without dead ends: 184 [2024-11-16 12:09:55,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2024-11-16 12:09:55,051 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 414 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-16 12:09:55,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 455 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-16 12:09:55,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-16 12:09:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 103. [2024-11-16 12:09:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.423529411764706) internal successors, (121), 85 states have internal predecessors, (121), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:09:55,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 151 transitions. [2024-11-16 12:09:55,071 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 151 transitions. Word has length 108 [2024-11-16 12:09:55,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:09:55,072 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 151 transitions. [2024-11-16 12:09:55,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:09:55,072 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 151 transitions. [2024-11-16 12:09:55,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 12:09:55,073 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:09:55,073 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:09:55,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 12:09:55,073 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:09:55,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:09:55,073 INFO L85 PathProgramCache]: Analyzing trace with hash 1448620113, now seen corresponding path program 1 times [2024-11-16 12:09:55,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:09:55,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787667815] [2024-11-16 12:09:55,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:09:55,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:09:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:09:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:09:55,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:09:55,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:09:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:09:55,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:09:55,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:09:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:09:55,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:09:55,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:09:55,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:09:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:09:55,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:09:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:09:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:09:55,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:55,937 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:09:55,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:09:55,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787667815] [2024-11-16 12:09:55,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787667815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:09:55,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:09:55,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:09:55,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234638107] [2024-11-16 12:09:55,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:09:55,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:09:55,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:09:55,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:09:55,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:09:55,939 INFO L87 Difference]: Start difference. First operand 103 states and 151 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:09:56,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:09:56,415 INFO L93 Difference]: Finished difference Result 269 states and 392 transitions. [2024-11-16 12:09:56,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:09:56,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-16 12:09:56,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:09:56,417 INFO L225 Difference]: With dead ends: 269 [2024-11-16 12:09:56,417 INFO L226 Difference]: Without dead ends: 169 [2024-11-16 12:09:56,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:09:56,418 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 96 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:09:56,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 454 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:09:56,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-16 12:09:56,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 97. [2024-11-16 12:09:56,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:09:56,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-11-16 12:09:56,430 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 108 [2024-11-16 12:09:56,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:09:56,431 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-11-16 12:09:56,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:09:56,431 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-11-16 12:09:56,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 12:09:56,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:09:56,432 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:09:56,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 12:09:56,433 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:09:56,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:09:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash 2106779220, now seen corresponding path program 1 times [2024-11-16 12:09:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:09:56,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993345364] [2024-11-16 12:09:56,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:09:56,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:09:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:56,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:09:56,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:56,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:09:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:56,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:09:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:56,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:09:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:56,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:09:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:56,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:09:56,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:56,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:09:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:57,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:09:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:57,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:09:57,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:57,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:09:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:09:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:57,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:09:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:57,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:09:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:57,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:09:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:57,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:09:57,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:57,008 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:09:57,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:09:57,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993345364] [2024-11-16 12:09:57,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [993345364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:09:57,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:09:57,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-16 12:09:57,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821594338] [2024-11-16 12:09:57,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:09:57,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-16 12:09:57,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:09:57,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-16 12:09:57,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:09:57,010 INFO L87 Difference]: Start difference. First operand 97 states and 142 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:09:57,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:09:57,533 INFO L93 Difference]: Finished difference Result 279 states and 403 transitions. [2024-11-16 12:09:57,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:09:57,533 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-16 12:09:57,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:09:57,534 INFO L225 Difference]: With dead ends: 279 [2024-11-16 12:09:57,534 INFO L226 Difference]: Without dead ends: 185 [2024-11-16 12:09:57,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-16 12:09:57,536 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 244 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:09:57,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 632 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:09:57,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-16 12:09:57,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 99. [2024-11-16 12:09:57,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.4197530864197532) internal successors, (115), 81 states have internal predecessors, (115), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:09:57,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 145 transitions. [2024-11-16 12:09:57,542 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 145 transitions. Word has length 108 [2024-11-16 12:09:57,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:09:57,542 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 145 transitions. [2024-11-16 12:09:57,542 INFO L472 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:09:57,542 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 145 transitions. [2024-11-16 12:09:57,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 12:09:57,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:09:57,543 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:09:57,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 12:09:57,544 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:09:57,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:09:57,544 INFO L85 PathProgramCache]: Analyzing trace with hash -368750623, now seen corresponding path program 1 times [2024-11-16 12:09:57,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:09:57,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691481081] [2024-11-16 12:09:57,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:09:57,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:09:57,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:09:58,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:09:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:09:58,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:09:58,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:09:58,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:09:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:09:58,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:09:58,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:09:58,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:09:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:09:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:09:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:09:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:09:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:09:58,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:58,175 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:09:58,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:09:58,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691481081] [2024-11-16 12:09:58,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691481081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:09:58,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:09:58,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-16 12:09:58,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395694572] [2024-11-16 12:09:58,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:09:58,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 12:09:58,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:09:58,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 12:09:58,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:09:58,177 INFO L87 Difference]: Start difference. First operand 99 states and 145 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:09:58,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:09:58,608 INFO L93 Difference]: Finished difference Result 266 states and 388 transitions. [2024-11-16 12:09:58,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:09:58,608 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-16 12:09:58,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:09:58,609 INFO L225 Difference]: With dead ends: 266 [2024-11-16 12:09:58,610 INFO L226 Difference]: Without dead ends: 170 [2024-11-16 12:09:58,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-16 12:09:58,610 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 95 mSDsluCounter, 499 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:09:58,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 617 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:09:58,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2024-11-16 12:09:58,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 97. [2024-11-16 12:09:58,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.4177215189873418) internal successors, (112), 79 states have internal predecessors, (112), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:09:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 142 transitions. [2024-11-16 12:09:58,617 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 142 transitions. Word has length 108 [2024-11-16 12:09:58,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:09:58,617 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 142 transitions. [2024-11-16 12:09:58,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:09:58,617 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 142 transitions. [2024-11-16 12:09:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-16 12:09:58,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:09:58,618 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:09:58,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 12:09:58,618 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:09:58,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:09:58,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1109706867, now seen corresponding path program 1 times [2024-11-16 12:09:58,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:09:58,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176809688] [2024-11-16 12:09:58,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:09:58,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:09:58,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:09:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:09:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:09:59,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:09:59,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:09:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:09:59,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:09:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:09:59,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:09:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:09:59,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:09:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:09:59,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:09:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:09:59,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:09:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,121 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:09:59,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:09:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176809688] [2024-11-16 12:09:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1176809688] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:09:59,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:09:59,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:09:59,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295710041] [2024-11-16 12:09:59,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:09:59,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:09:59,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:09:59,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:09:59,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:09:59,125 INFO L87 Difference]: Start difference. First operand 97 states and 142 transitions. Second operand has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:09:59,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:09:59,605 INFO L93 Difference]: Finished difference Result 232 states and 339 transitions. [2024-11-16 12:09:59,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:09:59,607 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 108 [2024-11-16 12:09:59,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:09:59,608 INFO L225 Difference]: With dead ends: 232 [2024-11-16 12:09:59,608 INFO L226 Difference]: Without dead ends: 138 [2024-11-16 12:09:59,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2024-11-16 12:09:59,610 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 87 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:09:59,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 348 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:09:59,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-16 12:09:59,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 76. [2024-11-16 12:09:59,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:09:59,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 107 transitions. [2024-11-16 12:09:59,621 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 107 transitions. Word has length 108 [2024-11-16 12:09:59,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:09:59,622 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 107 transitions. [2024-11-16 12:09:59,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 states have internal predecessors, (36), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:09:59,622 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 107 transitions. [2024-11-16 12:09:59,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 12:09:59,623 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:09:59,623 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:09:59,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 12:09:59,623 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:09:59,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:09:59,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1625305877, now seen corresponding path program 1 times [2024-11-16 12:09:59,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:09:59,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606073807] [2024-11-16 12:09:59,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:09:59,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:09:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:09:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:09:59,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:09:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:09:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:09:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:09:59,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:09:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:09:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:09:59,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:09:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:09:59,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:09:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:09:59,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:09:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:09:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,739 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 12:09:59,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:09:59,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606073807] [2024-11-16 12:09:59,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606073807] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:09:59,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487146448] [2024-11-16 12:09:59,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:09:59,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:09:59,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:09:59,741 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:09:59,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 12:09:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:09:59,820 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-16 12:09:59,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:10:00,045 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 174 proven. 42 refuted. 0 times theorem prover too weak. 204 trivial. 0 not checked. [2024-11-16 12:10:00,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:10:00,192 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 12:10:00,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487146448] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:10:00,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 12:10:00,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-16 12:10:00,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456569830] [2024-11-16 12:10:00,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 12:10:00,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 12:10:00,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:10:00,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 12:10:00,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:10:00,194 INFO L87 Difference]: Start difference. First operand 76 states and 107 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-16 12:10:00,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:10:00,349 INFO L93 Difference]: Finished difference Result 155 states and 216 transitions. [2024-11-16 12:10:00,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-16 12:10:00,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) Word has length 110 [2024-11-16 12:10:00,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:10:00,351 INFO L225 Difference]: With dead ends: 155 [2024-11-16 12:10:00,351 INFO L226 Difference]: Without dead ends: 82 [2024-11-16 12:10:00,351 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 244 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-16 12:10:00,352 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 105 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 12:10:00,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 160 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 12:10:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-16 12:10:00,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 80. [2024-11-16 12:10:00,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 61 states have (on average 1.2950819672131149) internal successors, (79), 61 states have internal predecessors, (79), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:10:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 109 transitions. [2024-11-16 12:10:00,358 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 109 transitions. Word has length 110 [2024-11-16 12:10:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:10:00,358 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 109 transitions. [2024-11-16 12:10:00,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 6 states have call successors, (43), 3 states have call predecessors, (43), 5 states have return successors, (44), 5 states have call predecessors, (44), 6 states have call successors, (44) [2024-11-16 12:10:00,358 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 109 transitions. [2024-11-16 12:10:00,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 12:10:00,359 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:10:00,359 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:10:00,376 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 12:10:00,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 12:10:00,564 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:10:00,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:10:00,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1114771700, now seen corresponding path program 1 times [2024-11-16 12:10:00,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:10:00,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621335262] [2024-11-16 12:10:00,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:00,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:10:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:10:00,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072532436] [2024-11-16 12:10:00,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:00,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:10:00,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:10:00,613 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:10:00,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 12:10:00,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:00,895 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-16 12:10:00,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:10:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 182 proven. 30 refuted. 0 times theorem prover too weak. 208 trivial. 0 not checked. [2024-11-16 12:10:01,032 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:10:01,243 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 12:10:01,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:10:01,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621335262] [2024-11-16 12:10:01,244 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 12:10:01,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072532436] [2024-11-16 12:10:01,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072532436] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 12:10:01,244 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:10:01,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-16 12:10:01,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486856218] [2024-11-16 12:10:01,245 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:10:01,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 12:10:01,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:10:01,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 12:10:01,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-16 12:10:01,246 INFO L87 Difference]: Start difference. First operand 80 states and 109 transitions. Second operand has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 12:10:01,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:10:01,961 INFO L93 Difference]: Finished difference Result 248 states and 327 transitions. [2024-11-16 12:10:01,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 12:10:01,962 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 110 [2024-11-16 12:10:01,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:10:01,963 INFO L225 Difference]: With dead ends: 248 [2024-11-16 12:10:01,963 INFO L226 Difference]: Without dead ends: 171 [2024-11-16 12:10:01,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=144, Invalid=362, Unknown=0, NotChecked=0, Total=506 [2024-11-16 12:10:01,964 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 235 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-16 12:10:01,964 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 558 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-16 12:10:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-16 12:10:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 114. [2024-11-16 12:10:01,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:10:01,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 156 transitions. [2024-11-16 12:10:01,972 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 156 transitions. Word has length 110 [2024-11-16 12:10:01,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:10:01,973 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 156 transitions. [2024-11-16 12:10:01,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.5) internal successors, (63), 14 states have internal predecessors, (63), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2024-11-16 12:10:01,973 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 156 transitions. [2024-11-16 12:10:01,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 12:10:01,974 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:10:01,974 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:10:01,987 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 12:10:02,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-16 12:10:02,178 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:10:02,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:10:02,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2053008738, now seen corresponding path program 1 times [2024-11-16 12:10:02,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:10:02,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835009739] [2024-11-16 12:10:02,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:02,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:10:02,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:10:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:10:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:10:02,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:10:02,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:10:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:10:02,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:10:02,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:10:02,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,223 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:10:02,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:10:02,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:10:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:10:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:10:02,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:10:02,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:10:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:10:02,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:10:02,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835009739] [2024-11-16 12:10:02,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835009739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:10:02,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:10:02,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:10:02,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572636851] [2024-11-16 12:10:02,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:10:02,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:10:02,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:10:02,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:10:02,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:10:02,232 INFO L87 Difference]: Start difference. First operand 114 states and 156 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:10:02,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:10:02,277 INFO L93 Difference]: Finished difference Result 277 states and 374 transitions. [2024-11-16 12:10:02,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:10:02,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 110 [2024-11-16 12:10:02,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:10:02,280 INFO L225 Difference]: With dead ends: 277 [2024-11-16 12:10:02,280 INFO L226 Difference]: Without dead ends: 166 [2024-11-16 12:10:02,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:10:02,281 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 83 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:10:02,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 174 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:10:02,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-16 12:10:02,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 114. [2024-11-16 12:10:02,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 94 states have (on average 1.3297872340425532) internal successors, (125), 94 states have internal predecessors, (125), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:10:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 155 transitions. [2024-11-16 12:10:02,291 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 155 transitions. Word has length 110 [2024-11-16 12:10:02,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:10:02,291 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 155 transitions. [2024-11-16 12:10:02,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:10:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 155 transitions. [2024-11-16 12:10:02,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-16 12:10:02,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:10:02,292 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:10:02,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 12:10:02,292 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:10:02,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:10:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash 376879712, now seen corresponding path program 1 times [2024-11-16 12:10:02,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:10:02,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858391395] [2024-11-16 12:10:02,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:02,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:10:02,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:10:02,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:10:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:10:02,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:10:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:10:02,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:10:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:10:02,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:10:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:10:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:10:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:10:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:10:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:10:02,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:10:02,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:10:02,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:02,523 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:10:02,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:10:02,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858391395] [2024-11-16 12:10:02,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858391395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:10:02,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:10:02,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 12:10:02,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594453995] [2024-11-16 12:10:02,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:10:02,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 12:10:02,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:10:02,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 12:10:02,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 12:10:02,525 INFO L87 Difference]: Start difference. First operand 114 states and 155 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:10:02,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:10:02,759 INFO L93 Difference]: Finished difference Result 342 states and 454 transitions. [2024-11-16 12:10:02,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 12:10:02,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 110 [2024-11-16 12:10:02,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:10:02,761 INFO L225 Difference]: With dead ends: 342 [2024-11-16 12:10:02,761 INFO L226 Difference]: Without dead ends: 231 [2024-11-16 12:10:02,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:10:02,762 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 143 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 12:10:02,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 364 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 12:10:02,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2024-11-16 12:10:02,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 119. [2024-11-16 12:10:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.3434343434343434) internal successors, (133), 99 states have internal predecessors, (133), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:10:02,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 163 transitions. [2024-11-16 12:10:02,772 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 163 transitions. Word has length 110 [2024-11-16 12:10:02,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:10:02,772 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 163 transitions. [2024-11-16 12:10:02,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:10:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 163 transitions. [2024-11-16 12:10:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 12:10:02,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:10:02,773 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:10:02,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 12:10:02,773 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:10:02,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:10:02,774 INFO L85 PathProgramCache]: Analyzing trace with hash 323990872, now seen corresponding path program 1 times [2024-11-16 12:10:02,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:10:02,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367858483] [2024-11-16 12:10:02,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:02,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:10:02,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:10:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:10:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:10:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:10:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:10:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:10:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:10:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:10:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:10:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:10:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:10:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:10:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:10:04,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:10:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:10:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:10:04,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:10:04,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367858483] [2024-11-16 12:10:04,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367858483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:10:04,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:10:04,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 12:10:04,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203095967] [2024-11-16 12:10:04,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:10:04,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 12:10:04,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:10:04,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 12:10:04,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-16 12:10:04,262 INFO L87 Difference]: Start difference. First operand 119 states and 163 transitions. Second operand has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:10:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:10:06,625 INFO L93 Difference]: Finished difference Result 307 states and 411 transitions. [2024-11-16 12:10:06,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-16 12:10:06,625 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-16 12:10:06,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:10:06,626 INFO L225 Difference]: With dead ends: 307 [2024-11-16 12:10:06,626 INFO L226 Difference]: Without dead ends: 191 [2024-11-16 12:10:06,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2024-11-16 12:10:06,628 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 283 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:10:06,629 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 550 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-16 12:10:06,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-11-16 12:10:06,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 146. [2024-11-16 12:10:06,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 126 states have (on average 1.3571428571428572) internal successors, (171), 126 states have internal predecessors, (171), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:10:06,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 201 transitions. [2024-11-16 12:10:06,641 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 201 transitions. Word has length 111 [2024-11-16 12:10:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:10:06,641 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 201 transitions. [2024-11-16 12:10:06,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.25) internal successors, (39), 12 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:10:06,641 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 201 transitions. [2024-11-16 12:10:06,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 12:10:06,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:10:06,642 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:10:06,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 12:10:06,643 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:10:06,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:10:06,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1352138154, now seen corresponding path program 1 times [2024-11-16 12:10:06,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:10:06,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367441687] [2024-11-16 12:10:06,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:06,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:10:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:10:06,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:10:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:10:06,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:10:06,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:10:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:10:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:10:06,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:10:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:10:06,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:10:06,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:10:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:10:06,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:10:06,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:10:06,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:10:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:06,904 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:10:06,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:10:06,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367441687] [2024-11-16 12:10:06,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367441687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:10:06,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:10:06,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 12:10:06,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718534028] [2024-11-16 12:10:06,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:10:06,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 12:10:06,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:10:06,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 12:10:06,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-16 12:10:06,907 INFO L87 Difference]: Start difference. First operand 146 states and 201 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:10:07,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:10:07,386 INFO L93 Difference]: Finished difference Result 429 states and 585 transitions. [2024-11-16 12:10:07,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 12:10:07,386 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-16 12:10:07,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:10:07,388 INFO L225 Difference]: With dead ends: 429 [2024-11-16 12:10:07,388 INFO L226 Difference]: Without dead ends: 286 [2024-11-16 12:10:07,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-16 12:10:07,388 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 177 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 485 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 12:10:07,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 485 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 12:10:07,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2024-11-16 12:10:07,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 237. [2024-11-16 12:10:07,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 198 states have (on average 1.3131313131313131) internal successors, (260), 198 states have internal predecessors, (260), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 12:10:07,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 320 transitions. [2024-11-16 12:10:07,406 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 320 transitions. Word has length 111 [2024-11-16 12:10:07,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:10:07,407 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 320 transitions. [2024-11-16 12:10:07,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 7 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:10:07,408 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 320 transitions. [2024-11-16 12:10:07,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 12:10:07,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:10:07,409 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:10:07,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 12:10:07,409 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:10:07,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:10:07,410 INFO L85 PathProgramCache]: Analyzing trace with hash 929942055, now seen corresponding path program 1 times [2024-11-16 12:10:07,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:10:07,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159757539] [2024-11-16 12:10:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:07,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:10:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 12:10:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 12:10:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 12:10:07,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 12:10:07,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-16 12:10:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 12:10:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-16 12:10:07,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 12:10:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-16 12:10:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 12:10:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 12:10:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-16 12:10:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 12:10:07,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 12:10:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 12:10:07,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:07,467 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 12:10:07,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 12:10:07,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159757539] [2024-11-16 12:10:07,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159757539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:10:07,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:10:07,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 12:10:07,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960997410] [2024-11-16 12:10:07,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:10:07,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 12:10:07,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 12:10:07,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 12:10:07,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:10:07,470 INFO L87 Difference]: Start difference. First operand 237 states and 320 transitions. Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:10:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:10:07,524 INFO L93 Difference]: Finished difference Result 513 states and 693 transitions. [2024-11-16 12:10:07,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 12:10:07,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 111 [2024-11-16 12:10:07,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:10:07,526 INFO L225 Difference]: With dead ends: 513 [2024-11-16 12:10:07,526 INFO L226 Difference]: Without dead ends: 279 [2024-11-16 12:10:07,526 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 12:10:07,527 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:10:07,527 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 161 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:10:07,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2024-11-16 12:10:07,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 244. [2024-11-16 12:10:07,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 205 states have (on average 1.3170731707317074) internal successors, (270), 205 states have internal predecessors, (270), 30 states have call successors, (30), 8 states have call predecessors, (30), 8 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 12:10:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 330 transitions. [2024-11-16 12:10:07,567 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 330 transitions. Word has length 111 [2024-11-16 12:10:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:10:07,568 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 330 transitions. [2024-11-16 12:10:07,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 12:10:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 330 transitions. [2024-11-16 12:10:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-16 12:10:07,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:10:07,569 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:10:07,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 12:10:07,570 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:10:07,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:10:07,570 INFO L85 PathProgramCache]: Analyzing trace with hash 197448443, now seen corresponding path program 1 times [2024-11-16 12:10:07,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 12:10:07,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870797691] [2024-11-16 12:10:07,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:07,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 12:10:07,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 12:10:07,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1417032364] [2024-11-16 12:10:07,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:07,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:10:07,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:10:07,601 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 12:10:07,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 12:10:08,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:10:08,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 12:10:08,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 12:10:08,118 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 12:10:08,118 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 12:10:08,120 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 12:10:08,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 12:10:08,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 12:10:08,328 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:10:08,398 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 12:10:08,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:10:08 BoogieIcfgContainer [2024-11-16 12:10:08,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 12:10:08,400 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 12:10:08,400 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 12:10:08,401 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 12:10:08,401 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:09:40" (3/4) ... [2024-11-16 12:10:08,403 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 12:10:08,404 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 12:10:08,404 INFO L158 Benchmark]: Toolchain (without parser) took 28946.84ms. Allocated memory was 167.8MB in the beginning and 388.0MB in the end (delta: 220.2MB). Free memory was 114.6MB in the beginning and 313.2MB in the end (delta: -198.6MB). Peak memory consumption was 21.6MB. Max. memory is 16.1GB. [2024-11-16 12:10:08,404 INFO L158 Benchmark]: CDTParser took 0.08ms. Allocated memory is still 96.5MB. Free memory is still 55.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:10:08,404 INFO L158 Benchmark]: CACSL2BoogieTranslator took 249.48ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 99.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 12:10:08,404 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.26ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 96.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:10:08,405 INFO L158 Benchmark]: Boogie Preprocessor took 47.83ms. Allocated memory is still 167.8MB. Free memory was 96.2MB in the beginning and 93.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 12:10:08,405 INFO L158 Benchmark]: IcfgBuilder took 506.84ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 119.7MB in the end (delta: -26.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 12:10:08,405 INFO L158 Benchmark]: TraceAbstraction took 28096.44ms. Allocated memory was 167.8MB in the beginning and 388.0MB in the end (delta: 220.2MB). Free memory was 118.5MB in the beginning and 313.2MB in the end (delta: -194.7MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-11-16 12:10:08,405 INFO L158 Benchmark]: Witness Printer took 3.26ms. Allocated memory is still 388.0MB. Free memory is still 313.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 12:10:08,406 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.08ms. Allocated memory is still 96.5MB. Free memory is still 55.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 249.48ms. Allocated memory is still 167.8MB. Free memory was 114.6MB in the beginning and 99.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.26ms. Allocated memory is still 167.8MB. Free memory was 99.4MB in the beginning and 96.2MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.83ms. Allocated memory is still 167.8MB. Free memory was 96.2MB in the beginning and 93.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 506.84ms. Allocated memory is still 167.8MB. Free memory was 93.6MB in the beginning and 119.7MB in the end (delta: -26.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28096.44ms. Allocated memory was 167.8MB in the beginning and 388.0MB in the end (delta: 220.2MB). Free memory was 118.5MB in the beginning and 313.2MB in the end (delta: -194.7MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. * Witness Printer took 3.26ms. Allocated memory is still 388.0MB. Free memory is still 313.2MB. There was no memory consumed. Max. memory is 16.1GB. * 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 114, overapproximation of shiftLeft at line 114. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] signed short int var_1_3 = 1; [L24] signed long int var_1_5 = -64; [L25] signed char var_1_6 = 10; [L26] signed char var_1_7 = 5; [L27] double var_1_8 = 16.25; [L28] double var_1_9 = 1.8; [L29] unsigned char var_1_10 = 32; [L30] unsigned char var_1_11 = 64; [L31] unsigned short int var_1_12 = 16; [L32] unsigned long int var_1_13 = 128; [L33] unsigned char var_1_15 = 1; [L34] unsigned short int var_1_16 = 256; [L35] signed char var_1_18 = -2; [L36] unsigned char last_1_var_1_10 = 32; [L37] unsigned short int last_1_var_1_12 = 16; [L38] unsigned long int last_1_var_1_13 = 128; VAL [isInitial=0, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L118] isInitial = 1 [L119] FCALL initially() [L120] COND TRUE 1 [L121] CALL updateLastVariables() [L109] last_1_var_1_10 = var_1_10 [L110] last_1_var_1_12 = var_1_12 [L111] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=1, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L121] RET updateLastVariables() [L122] CALL updateVariables() [L84] var_1_3 = __VERIFIER_nondet_short() [L85] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L85] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L86] CALL assume_abort_if_not(var_1_3 <= 8) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L86] RET assume_abort_if_not(var_1_3 <= 8) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=-64, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L87] var_1_5 = __VERIFIER_nondet_long() [L88] CALL assume_abort_if_not(var_1_5 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L88] RET assume_abort_if_not(var_1_5 >= -2147483648) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L89] CALL assume_abort_if_not(var_1_5 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L89] RET assume_abort_if_not(var_1_5 <= 2147483647) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] CALL assume_abort_if_not(var_1_5 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L90] RET assume_abort_if_not(var_1_5 != 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=10, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L91] var_1_6 = __VERIFIER_nondet_char() [L92] CALL assume_abort_if_not(var_1_6 >= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L92] RET assume_abort_if_not(var_1_6 >= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] CALL assume_abort_if_not(var_1_6 <= 12) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L93] RET assume_abort_if_not(var_1_6 <= 12) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=5, var_1_8=65/4, var_1_9=9/5] [L94] var_1_7 = __VERIFIER_nondet_char() [L95] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L95] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L96] CALL assume_abort_if_not(var_1_7 <= 6) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L96] RET assume_abort_if_not(var_1_7 <= 6) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_8=65/4, var_1_9=9/5] [L97] var_1_8 = __VERIFIER_nondet_double() [L98] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_9=9/5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_9=9/5] [L98] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0, var_1_9=9/5] [L99] var_1_9 = __VERIFIER_nondet_double() [L100] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L100] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=64, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L101] var_1_11 = __VERIFIER_nondet_uchar() [L102] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L102] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L103] CALL assume_abort_if_not(var_1_11 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L103] RET assume_abort_if_not(var_1_11 <= 254) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L104] var_1_15 = __VERIFIER_nondet_uchar() [L105] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L105] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L106] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L106] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=16, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L122] RET updateVariables() [L123] CALL step() [L42] COND TRUE ((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10 [L43] var_1_12 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=32, var_1_11=12, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L45] COND TRUE var_1_6 <= (last_1_var_1_12 + var_1_7) [L46] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=-2, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L50] var_1_18 = var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L51] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=128, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L51] COND FALSE !((1 << var_1_10) != (-500 / -100)) [L58] var_1_13 = var_1_6 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=256, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L60] COND FALSE !((- var_1_9) <= var_1_8) [L73] var_1_16 = var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L75] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L75] COND FALSE !((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) [L123] RET step() [L124] CALL, EXPR property() [L114] EXPR var_1_16 >> var_1_3 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114] EXPR ((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114] EXPR 1 << var_1_10 VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114] EXPR (((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6))) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L114-L115] return (((((((var_1_16 >> var_1_3) == (var_1_10 / var_1_5)) ? (((var_1_3 << (var_1_6 - var_1_7)) > ((var_1_10 & 0) * var_1_5)) ? (var_1_1 == ((double) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((double) var_1_8))) : 1) && ((var_1_6 <= (last_1_var_1_12 + var_1_7)) ? (var_1_10 == ((unsigned char) var_1_11)) : (var_1_10 == ((unsigned char) (var_1_3 + var_1_7))))) && ((((var_1_6 >> 2) * last_1_var_1_13) > last_1_var_1_10) ? (var_1_12 == ((unsigned short int) var_1_6)) : 1)) && (((1 << var_1_10) != (-500 / -100)) ? (((var_1_6 - var_1_3) >= (var_1_12 + 256)) ? (var_1_13 == ((unsigned long int) var_1_11)) : (var_1_13 == ((unsigned long int) var_1_12))) : (var_1_13 == ((unsigned long int) var_1_6)))) && (((- var_1_9) <= var_1_8) ? (var_1_15 ? ((((((var_1_11) > ((var_1_12 * -64))) ? (var_1_11) : ((var_1_12 * -64)))) < var_1_12) ? ((var_1_13 == var_1_10) ? (var_1_16 == ((unsigned short int) var_1_11)) : 1) : (var_1_16 == ((unsigned short int) 256))) : (var_1_16 == ((unsigned short int) var_1_3))) : (var_1_16 == ((unsigned short int) var_1_10)))) && (var_1_18 == ((signed char) var_1_3)) ; [L124] RET, EXPR property() [L124] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=32, last_1_var_1_12=16, last_1_var_1_13=128, var_1_10=12, var_1_11=12, var_1_12=12, var_1_13=12, var_1_15=1, var_1_16=12, var_1_18=0, var_1_1=11/2, var_1_3=0, var_1_5=13, var_1_6=12, var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.0s, OverallIterations: 17, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 13.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2840 SdHoareTripleChecker+Valid, 9.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2834 mSDsluCounter, 5941 SdHoareTripleChecker+Invalid, 8.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4351 mSDsCounter, 128 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4473 IncrementalHoareTripleChecker+Invalid, 4601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 128 mSolverCounterUnsat, 1590 mSDtfsCounter, 4473 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1084 GetRequests, 950 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 6.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=244occurred in iteration=16, InterpolantAutomatonStates: 112, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 881 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 2185 NumberOfCodeBlocks, 2185 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2054 ConstructedInterpolants, 0 QuantifiedInterpolants, 8740 SizeOfPredicates, 9 NumberOfNonLiveVariables, 532 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 19 InterpolantComputations, 14 PerfectInterpolantSequences, 7794/7980 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 [2024-11-16 12:10:08,465 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 12:10:10,255 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 12:10:10,319 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 12:10:10,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 12:10:10,323 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 12:10:10,347 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 12:10:10,350 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 12:10:10,350 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 12:10:10,351 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 12:10:10,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 12:10:10,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 12:10:10,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 12:10:10,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 12:10:10,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 12:10:10,353 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 12:10:10,353 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 12:10:10,354 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 12:10:10,354 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 12:10:10,354 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 12:10:10,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 12:10:10,356 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 12:10:10,356 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 12:10:10,357 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 12:10:10,357 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 12:10:10,357 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 12:10:10,357 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 12:10:10,359 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 12:10:10,360 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 12:10:10,360 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 12:10:10,360 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 12:10:10,360 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 12:10:10,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 12:10:10,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 12:10:10,361 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 12:10:10,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:10:10,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 12:10:10,361 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 12:10:10,361 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 12:10:10,361 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 12:10:10,361 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 12:10:10,361 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 12:10:10,363 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 12:10:10,363 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 12:10:10,363 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 12:10:10,363 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c2c331e2f68e9d93ed0b3a3f04be22ea072b7c552ef634090004a61d599de390 [2024-11-16 12:10:10,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 12:10:10,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 12:10:10,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 12:10:10,652 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 12:10:10,653 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 12:10:10,654 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2024-11-16 12:10:12,076 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 12:10:12,231 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 12:10:12,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i [2024-11-16 12:10:12,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e8e006e/86076207f3be48ca9552986c0e64d0d4/FLAGa57c871ab [2024-11-16 12:10:12,251 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e8e006e/86076207f3be48ca9552986c0e64d0d4 [2024-11-16 12:10:12,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 12:10:12,254 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 12:10:12,267 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 12:10:12,267 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 12:10:12,272 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 12:10:12,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5d65fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12, skipping insertion in model container [2024-11-16 12:10:12,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,300 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 12:10:12,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i[918,931] [2024-11-16 12:10:12,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:10:12,526 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 12:10:12,535 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-9.i[918,931] [2024-11-16 12:10:12,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 12:10:12,585 INFO L204 MainTranslator]: Completed translation [2024-11-16 12:10:12,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12 WrapperNode [2024-11-16 12:10:12,585 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 12:10:12,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 12:10:12,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 12:10:12,586 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 12:10:12,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,601 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,629 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 115 [2024-11-16 12:10:12,629 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 12:10:12,630 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 12:10:12,630 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 12:10:12,630 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 12:10:12,638 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,645 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,657 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]. [2024-11-16 12:10:12,657 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,657 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,663 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,664 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,666 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,668 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 12:10:12,669 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 12:10:12,669 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 12:10:12,669 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 12:10:12,669 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (1/1) ... [2024-11-16 12:10:12,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 12:10:12,686 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 12:10:12,699 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) [2024-11-16 12:10:12,704 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 [2024-11-16 12:10:12,732 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 12:10:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 12:10:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 12:10:12,733 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 12:10:12,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 12:10:12,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 12:10:12,818 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 12:10:12,820 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 12:10:13,058 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-16 12:10:13,058 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 12:10:13,069 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 12:10:13,069 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 12:10:13,070 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:10:13 BoogieIcfgContainer [2024-11-16 12:10:13,070 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 12:10:13,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 12:10:13,072 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 12:10:13,074 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 12:10:13,074 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:10:12" (1/3) ... [2024-11-16 12:10:13,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa18a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:10:13, skipping insertion in model container [2024-11-16 12:10:13,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:12" (2/3) ... [2024-11-16 12:10:13,075 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa18a34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:10:13, skipping insertion in model container [2024-11-16 12:10:13,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 12:10:13" (3/3) ... [2024-11-16 12:10:13,076 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-9.i [2024-11-16 12:10:13,089 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 12:10:13,090 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 12:10:13,141 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 12:10:13,148 INFO L333 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, 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;@60b80cb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 12:10:13,149 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 12:10:13,152 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:10:13,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 12:10:13,162 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:10:13,162 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:10:13,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:10:13,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:10:13,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1336791203, now seen corresponding path program 1 times [2024-11-16 12:10:13,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:10:13,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914567544] [2024-11-16 12:10:13,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:13,183 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:10:13,183 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:10:13,186 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:10:13,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 12:10:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:13,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 12:10:13,351 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:10:13,377 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2024-11-16 12:10:13,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 12:10:13,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:10:13,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914567544] [2024-11-16 12:10:13,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914567544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 12:10:13,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 12:10:13,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 12:10:13,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645122004] [2024-11-16 12:10:13,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 12:10:13,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 12:10:13,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:10:13,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 12:10:13,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:10:13,400 INFO L87 Difference]: Start difference. First operand has 56 states, 38 states have (on average 1.394736842105263) internal successors, (53), 39 states have internal predecessors, (53), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:10:13,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:10:13,424 INFO L93 Difference]: Finished difference Result 104 states and 174 transitions. [2024-11-16 12:10:13,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 12:10:13,428 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 100 [2024-11-16 12:10:13,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:10:13,434 INFO L225 Difference]: With dead ends: 104 [2024-11-16 12:10:13,435 INFO L226 Difference]: Without dead ends: 51 [2024-11-16 12:10:13,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 12:10:13,440 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 12:10:13,440 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 12:10:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-11-16 12:10:13,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-11-16 12:10:13,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 34 states have internal predecessors, (44), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 12:10:13,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 74 transitions. [2024-11-16 12:10:13,480 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 74 transitions. Word has length 100 [2024-11-16 12:10:13,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:10:13,480 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 74 transitions. [2024-11-16 12:10:13,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 16.0) internal successors, (32), 2 states have internal predecessors, (32), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 12:10:13,481 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 74 transitions. [2024-11-16 12:10:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 12:10:13,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:10:13,484 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:10:13,491 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 12:10:13,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:10:13,687 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:10:13,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:10:13,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1150681289, now seen corresponding path program 1 times [2024-11-16 12:10:13,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:10:13,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533174986] [2024-11-16 12:10:13,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:13,688 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:10:13,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:10:13,697 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:10:13,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 12:10:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:13,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 12:10:13,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:10:14,820 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 243 proven. 72 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2024-11-16 12:10:14,821 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:10:15,087 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 12:10:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533174986] [2024-11-16 12:10:15,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533174986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:10:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [993997375] [2024-11-16 12:10:15,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:15,088 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-16 12:10:15,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-16 12:10:15,091 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-16 12:10:15,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-16 12:10:15,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:15,417 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 12:10:15,422 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 12:10:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 228 proven. 63 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2024-11-16 12:10:15,988 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 12:10:16,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [993997375] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 12:10:16,223 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 12:10:16,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 15 [2024-11-16 12:10:16,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804987064] [2024-11-16 12:10:16,224 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 12:10:16,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-16 12:10:16,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 12:10:16,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-16 12:10:16,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2024-11-16 12:10:16,225 INFO L87 Difference]: Start difference. First operand 51 states and 74 transitions. Second operand has 16 states, 16 states have (on average 3.375) internal successors, (54), 14 states have internal predecessors, (54), 5 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-11-16 12:10:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 12:10:17,085 INFO L93 Difference]: Finished difference Result 184 states and 257 transitions. [2024-11-16 12:10:17,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-16 12:10:17,090 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 14 states have internal predecessors, (54), 5 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) Word has length 101 [2024-11-16 12:10:17,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 12:10:17,092 INFO L225 Difference]: With dead ends: 184 [2024-11-16 12:10:17,092 INFO L226 Difference]: Without dead ends: 136 [2024-11-16 12:10:17,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 286 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=381, Invalid=951, Unknown=0, NotChecked=0, Total=1332 [2024-11-16 12:10:17,095 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 165 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 12:10:17,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 390 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 12:10:17,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-16 12:10:17,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 113. [2024-11-16 12:10:17,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 76 states have (on average 1.25) internal successors, (95), 76 states have internal predecessors, (95), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-16 12:10:17,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 155 transitions. [2024-11-16 12:10:17,116 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 155 transitions. Word has length 101 [2024-11-16 12:10:17,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 12:10:17,117 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 155 transitions. [2024-11-16 12:10:17,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.375) internal successors, (54), 14 states have internal predecessors, (54), 5 states have call successors, (21), 5 states have call predecessors, (21), 7 states have return successors, (22), 5 states have call predecessors, (22), 5 states have call successors, (22) [2024-11-16 12:10:17,117 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 155 transitions. [2024-11-16 12:10:17,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 12:10:17,118 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 12:10:17,118 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 12:10:17,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-16 12:10:17,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 12:10:17,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:10:17,523 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 12:10:17,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 12:10:17,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1347334648, now seen corresponding path program 1 times [2024-11-16 12:10:17,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 12:10:17,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229608748] [2024-11-16 12:10:17,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 12:10:17,526 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 12:10:17,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 12:10:17,528 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 12:10:17,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 12:10:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 12:10:17,647 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 12:10:17,652 INFO L278 TraceCheckSpWp]: Computing forward predicates...