./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6ae2ee47 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 ../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-10.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 7a3066d73095e1fdcb5cedffd45d35ce8e4fafd1dd368f5e708224be9a677a7a --- Real Ultimate output --- This is Ultimate 0.2.3-dev-6ae2ee4-m [2023-11-22 18:45:27,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-22 18:45:27,225 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-22 18:45:27,231 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-22 18:45:27,231 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-22 18:45:27,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-22 18:45:27,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-22 18:45:27,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-22 18:45:27,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-22 18:45:27,259 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-22 18:45:27,260 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-22 18:45:27,260 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-22 18:45:27,261 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-22 18:45:27,262 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-22 18:45:27,262 INFO L153 SettingsManager]: * Use SBE=true [2023-11-22 18:45:27,262 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-22 18:45:27,262 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-22 18:45:27,262 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-22 18:45:27,263 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-22 18:45:27,263 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-22 18:45:27,263 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-22 18:45:27,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-22 18:45:27,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-22 18:45:27,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-22 18:45:27,264 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-22 18:45:27,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-22 18:45:27,265 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-22 18:45:27,265 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-22 18:45:27,265 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-22 18:45:27,266 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-22 18:45:27,266 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-22 18:45:27,267 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:45:27,267 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-22 18:45:27,267 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-22 18:45:27,267 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-22 18:45:27,267 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-22 18:45:27,268 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-22 18:45:27,268 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-22 18:45:27,268 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-22 18:45:27,268 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-22 18:45:27,268 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-22 18:45:27,269 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-22 18:45:27,269 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 -> 7a3066d73095e1fdcb5cedffd45d35ce8e4fafd1dd368f5e708224be9a677a7a [2023-11-22 18:45:27,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-22 18:45:27,511 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-22 18:45:27,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-22 18:45:27,514 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-22 18:45:27,514 INFO L274 PluginConnector]: CDTParser initialized [2023-11-22 18:45:27,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-10.i [2023-11-22 18:45:28,501 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-22 18:45:28,641 INFO L384 CDTParser]: Found 1 translation units. [2023-11-22 18:45:28,642 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-10.i [2023-11-22 18:45:28,649 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a27bf00c/43a8a845a81b40f78c344fdba64b1495/FLAG4b45cd91b [2023-11-22 18:45:28,660 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a27bf00c/43a8a845a81b40f78c344fdba64b1495 [2023-11-22 18:45:28,662 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-22 18:45:28,663 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-22 18:45:28,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-22 18:45:28,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-22 18:45:28,669 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-22 18:45:28,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:45:28" (1/1) ... [2023-11-22 18:45:28,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ff4cf02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:28, skipping insertion in model container [2023-11-22 18:45:28,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 06:45:28" (1/1) ... [2023-11-22 18:45:28,696 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-22 18:45:28,884 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-10.i[919,932] [2023-11-22 18:45:28,947 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:45:28,965 INFO L202 MainTranslator]: Completed pre-run [2023-11-22 18:45:28,978 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_codestructure_dependencies_file-10.i[919,932] [2023-11-22 18:45:29,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-22 18:45:29,023 INFO L206 MainTranslator]: Completed translation [2023-11-22 18:45:29,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29 WrapperNode [2023-11-22 18:45:29,024 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-22 18:45:29,025 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-22 18:45:29,026 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-22 18:45:29,026 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-22 18:45:29,031 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,049 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,083 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 151 [2023-11-22 18:45:29,084 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-22 18:45:29,086 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-22 18:45:29,086 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-22 18:45:29,086 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-22 18:45:29,095 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,095 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,107 INFO L184 PluginConnector]: Executing the observer HeapSplitter from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,130 INFO L189 HeapSplitter]: Split 2 memory accesses to 1 slices as follows [2] [2023-11-22 18:45:29,130 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,139 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,147 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,148 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-22 18:45:29,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-22 18:45:29,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-22 18:45:29,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-22 18:45:29,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (1/1) ... [2023-11-22 18:45:29,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-22 18:45:29,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-22 18:45:29,197 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-22 18:45:29,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-22 18:45:29,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-22 18:45:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-22 18:45:29,233 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-22 18:45:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-22 18:45:29,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-22 18:45:29,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-22 18:45:29,301 INFO L241 CfgBuilder]: Building ICFG [2023-11-22 18:45:29,303 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-22 18:45:29,567 INFO L282 CfgBuilder]: Performing block encoding [2023-11-22 18:45:29,585 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-22 18:45:29,585 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-22 18:45:29,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:45:29 BoogieIcfgContainer [2023-11-22 18:45:29,586 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-22 18:45:29,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-22 18:45:29,588 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-22 18:45:29,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-22 18:45:29,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 06:45:28" (1/3) ... [2023-11-22 18:45:29,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5737df44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:45:29, skipping insertion in model container [2023-11-22 18:45:29,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 06:45:29" (2/3) ... [2023-11-22 18:45:29,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5737df44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 06:45:29, skipping insertion in model container [2023-11-22 18:45:29,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 06:45:29" (3/3) ... [2023-11-22 18:45:29,592 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-10.i [2023-11-22 18:45:29,604 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-22 18:45:29,604 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-22 18:45:29,640 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-22 18:45:29,646 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6ca8c820, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-22 18:45:29,646 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-22 18:45:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 40 states have (on average 1.525) internal successors, (61), 41 states have internal predecessors, (61), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-22 18:45:29,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-22 18:45:29,660 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:29,661 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:29,662 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:29,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:29,666 INFO L85 PathProgramCache]: Analyzing trace with hash 794996002, now seen corresponding path program 1 times [2023-11-22 18:45:29,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:45:29,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325568158] [2023-11-22 18:45:29,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:29,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:45:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 18:45:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:45:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 18:45:29,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 18:45:29,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 18:45:29,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 18:45:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 18:45:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 18:45:29,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 18:45:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 18:45:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 18:45:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 18:45:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 18:45:29,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 18:45:29,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-22 18:45:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 18:45:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 18:45:29,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 18:45:29,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:29,983 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-22 18:45:29,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:45:29,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325568158] [2023-11-22 18:45:29,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325568158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:29,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:29,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-22 18:45:29,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173388998] [2023-11-22 18:45:29,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:29,991 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-22 18:45:29,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:45:30,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-22 18:45:30,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:45:30,025 INFO L87 Difference]: Start difference. First operand has 61 states, 40 states have (on average 1.525) internal successors, (61), 41 states have internal predecessors, (61), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-22 18:45:30,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:30,075 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2023-11-22 18:45:30,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-22 18:45:30,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 115 [2023-11-22 18:45:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:30,083 INFO L225 Difference]: With dead ends: 119 [2023-11-22 18:45:30,084 INFO L226 Difference]: Without dead ends: 59 [2023-11-22 18:45:30,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-22 18:45:30,089 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:30,090 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 89 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-22 18:45:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-11-22 18:45:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-11-22 18:45:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.435897435897436) internal successors, (56), 39 states have internal predecessors, (56), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-22 18:45:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 92 transitions. [2023-11-22 18:45:30,146 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 92 transitions. Word has length 115 [2023-11-22 18:45:30,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:30,146 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 92 transitions. [2023-11-22 18:45:30,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-22 18:45:30,147 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 92 transitions. [2023-11-22 18:45:30,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2023-11-22 18:45:30,152 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:30,152 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:30,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-22 18:45:30,152 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:30,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:30,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1019182110, now seen corresponding path program 1 times [2023-11-22 18:45:30,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:45:30,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800129711] [2023-11-22 18:45:30,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:30,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:45:30,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 18:45:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:45:30,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 18:45:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 18:45:30,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 18:45:30,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 18:45:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 18:45:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 18:45:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 18:45:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 18:45:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 18:45:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 18:45:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 18:45:30,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 18:45:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-22 18:45:30,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 18:45:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 18:45:30,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 18:45:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:30,483 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-22 18:45:30,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:45:30,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800129711] [2023-11-22 18:45:30,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800129711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:30,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:30,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-22 18:45:30,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127076634] [2023-11-22 18:45:30,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:30,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-22 18:45:30,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:45:30,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-22 18:45:30,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-22 18:45:30,487 INFO L87 Difference]: Start difference. First operand 59 states and 92 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-22 18:45:30,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:30,607 INFO L93 Difference]: Finished difference Result 176 states and 275 transitions. [2023-11-22 18:45:30,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-22 18:45:30,608 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 115 [2023-11-22 18:45:30,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:30,609 INFO L225 Difference]: With dead ends: 176 [2023-11-22 18:45:30,610 INFO L226 Difference]: Without dead ends: 118 [2023-11-22 18:45:30,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-22 18:45:30,611 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 60 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:30,611 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 256 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-22 18:45:30,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-22 18:45:30,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 92. [2023-11-22 18:45:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.320754716981132) internal successors, (70), 53 states have internal predecessors, (70), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-22 18:45:30,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 142 transitions. [2023-11-22 18:45:30,626 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 142 transitions. Word has length 115 [2023-11-22 18:45:30,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:30,627 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 142 transitions. [2023-11-22 18:45:30,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-22 18:45:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 142 transitions. [2023-11-22 18:45:30,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-22 18:45:30,628 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:30,628 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:30,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-22 18:45:30,629 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:30,629 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:30,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1251763523, now seen corresponding path program 1 times [2023-11-22 18:45:30,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:45:30,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859877788] [2023-11-22 18:45:30,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:30,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:45:30,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 18:45:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:45:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 18:45:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 18:45:50,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 18:45:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 18:45:50,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 18:45:50,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 18:45:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 18:45:50,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 18:45:50,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 18:45:50,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 18:45:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 18:45:50,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 18:45:50,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-22 18:45:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 18:45:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 18:45:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 18:45:50,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:45:50,767 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-22 18:45:50,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:45:50,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859877788] [2023-11-22 18:45:50,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859877788] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:45:50,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:45:50,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 18:45:50,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178575401] [2023-11-22 18:45:50,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:45:50,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 18:45:50,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:45:50,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 18:45:50,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-22 18:45:50,772 INFO L87 Difference]: Start difference. First operand 92 states and 142 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-22 18:45:51,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:45:51,602 INFO L93 Difference]: Finished difference Result 228 states and 349 transitions. [2023-11-22 18:45:51,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-22 18:45:51,603 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2023-11-22 18:45:51,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:45:51,605 INFO L225 Difference]: With dead ends: 228 [2023-11-22 18:45:51,605 INFO L226 Difference]: Without dead ends: 170 [2023-11-22 18:45:51,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=82, Invalid=128, Unknown=0, NotChecked=0, Total=210 [2023-11-22 18:45:51,607 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 176 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-22 18:45:51,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 425 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-22 18:45:51,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2023-11-22 18:45:51,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 107. [2023-11-22 18:45:51,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.3970588235294117) internal successors, (95), 68 states have internal predecessors, (95), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-22 18:45:51,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 167 transitions. [2023-11-22 18:45:51,620 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 167 transitions. Word has length 116 [2023-11-22 18:45:51,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:45:51,621 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 167 transitions. [2023-11-22 18:45:51,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-22 18:45:51,621 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 167 transitions. [2023-11-22 18:45:51,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-22 18:45:51,623 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:45:51,623 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:45:51,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-22 18:45:51,623 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:45:51,624 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:45:51,624 INFO L85 PathProgramCache]: Analyzing trace with hash 523243839, now seen corresponding path program 1 times [2023-11-22 18:45:51,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:45:51,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445502048] [2023-11-22 18:45:51,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:45:51,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:45:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 18:47:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:47:26,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 18:47:26,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 18:47:26,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 18:47:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 18:47:26,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 18:47:26,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 18:47:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 18:47:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 18:47:26,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 18:47:26,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 18:47:26,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 18:47:26,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 18:47:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-22 18:47:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 18:47:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 18:47:26,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 18:47:26,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:47:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-22 18:47:26,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:47:26,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445502048] [2023-11-22 18:47:26,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445502048] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:47:26,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:47:26,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-22 18:47:26,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731120537] [2023-11-22 18:47:26,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:47:26,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-22 18:47:26,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:47:26,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-22 18:47:26,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-22 18:47:26,665 INFO L87 Difference]: Start difference. First operand 107 states and 167 transitions. Second operand has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-22 18:47:27,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:47:27,605 INFO L93 Difference]: Finished difference Result 269 states and 411 transitions. [2023-11-22 18:47:27,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-22 18:47:27,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 116 [2023-11-22 18:47:27,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:47:27,607 INFO L225 Difference]: With dead ends: 269 [2023-11-22 18:47:27,607 INFO L226 Difference]: Without dead ends: 196 [2023-11-22 18:47:27,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=85, Invalid=125, Unknown=0, NotChecked=0, Total=210 [2023-11-22 18:47:27,609 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 227 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 227 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-22 18:47:27,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [227 Valid, 402 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-22 18:47:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-11-22 18:47:27,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 115. [2023-11-22 18:47:27,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 76 states have (on average 1.4342105263157894) internal successors, (109), 76 states have internal predecessors, (109), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-22 18:47:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 181 transitions. [2023-11-22 18:47:27,635 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 181 transitions. Word has length 116 [2023-11-22 18:47:27,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:47:27,636 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 181 transitions. [2023-11-22 18:47:27,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 9 states have internal predecessors, (29), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-22 18:47:27,638 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 181 transitions. [2023-11-22 18:47:27,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-22 18:47:27,641 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:47:27,641 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:47:27,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-22 18:47:27,642 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:47:27,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:47:27,642 INFO L85 PathProgramCache]: Analyzing trace with hash -819439171, now seen corresponding path program 1 times [2023-11-22 18:47:27,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:47:27,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752370578] [2023-11-22 18:47:27,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:47:27,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:47:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-22 18:49:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-22 18:49:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-22 18:49:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-22 18:49:08,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-22 18:49:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-22 18:49:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-22 18:49:08,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-22 18:49:08,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-22 18:49:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-22 18:49:08,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-22 18:49:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-22 18:49:08,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-22 18:49:08,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-22 18:49:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-22 18:49:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-22 18:49:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-22 18:49:08,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-22 18:49:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-22 18:49:08,953 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-22 18:49:08,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-22 18:49:08,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752370578] [2023-11-22 18:49:08,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752370578] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-22 18:49:08,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-22 18:49:08,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2023-11-22 18:49:08,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672417522] [2023-11-22 18:49:08,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-22 18:49:08,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-22 18:49:08,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-22 18:49:08,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-22 18:49:08,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-22 18:49:08,956 INFO L87 Difference]: Start difference. First operand 115 states and 181 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-22 18:49:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-22 18:49:12,301 INFO L93 Difference]: Finished difference Result 301 states and 457 transitions. [2023-11-22 18:49:12,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-22 18:49:12,302 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 116 [2023-11-22 18:49:12,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-22 18:49:12,307 INFO L225 Difference]: With dead ends: 301 [2023-11-22 18:49:12,307 INFO L226 Difference]: Without dead ends: 220 [2023-11-22 18:49:12,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=216, Invalid=486, Unknown=0, NotChecked=0, Total=702 [2023-11-22 18:49:12,308 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 491 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-11-22 18:49:12,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 331 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-11-22 18:49:12,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2023-11-22 18:49:12,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 118. [2023-11-22 18:49:12,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 79 states have (on average 1.4430379746835442) internal successors, (114), 79 states have internal predecessors, (114), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-22 18:49:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 186 transitions. [2023-11-22 18:49:12,325 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 186 transitions. Word has length 116 [2023-11-22 18:49:12,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-22 18:49:12,326 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 186 transitions. [2023-11-22 18:49:12,326 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-22 18:49:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 186 transitions. [2023-11-22 18:49:12,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2023-11-22 18:49:12,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-22 18:49:12,327 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-22 18:49:12,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-22 18:49:12,327 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-22 18:49:12,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-22 18:49:12,328 INFO L85 PathProgramCache]: Analyzing trace with hash -139380801, now seen corresponding path program 1 times [2023-11-22 18:49:12,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-22 18:49:12,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658919473] [2023-11-22 18:49:12,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-22 18:49:12,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-22 18:49:12,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Killed by 15