./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.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 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 14:11:26,389 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 14:11:26,459 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 14:11:26,462 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 14:11:26,462 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 14:11:26,481 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 14:11:26,482 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 14:11:26,482 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 14:11:26,483 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 14:11:26,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 14:11:26,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 14:11:26,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 14:11:26,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 14:11:26,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 14:11:26,487 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 14:11:26,487 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 14:11:26,487 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 14:11:26,487 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 14:11:26,488 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 14:11:26,488 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 14:11:26,488 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 14:11:26,490 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 14:11:26,490 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 14:11:26,490 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 14:11:26,490 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 14:11:26,491 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 14:11:26,491 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 14:11:26,491 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 14:11:26,491 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 14:11:26,491 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 14:11:26,491 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 14:11:26,492 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 14:11:26,492 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:11:26,492 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 14:11:26,492 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 14:11:26,492 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 14:11:26,492 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 14:11:26,493 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 14:11:26,493 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 14:11:26,493 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 14:11:26,493 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 14:11:26,495 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 14:11:26,495 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 -> 2adf86622f346d8406b4270c76c12e01b0cd0b4263eaaf0f4abdb5436079ce86 [2024-10-14 14:11:26,690 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 14:11:26,712 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 14:11:26,715 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 14:11:26,716 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 14:11:26,716 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 14:11:26,717 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-10-14 14:11:28,158 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 14:11:28,307 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 14:11:28,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-sp_file-8.i [2024-10-14 14:11:28,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0280f3f2c/8ac3b686054a41b9986a95e865c94e1d/FLAGdd87f2082 [2024-10-14 14:11:28,324 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0280f3f2c/8ac3b686054a41b9986a95e865c94e1d [2024-10-14 14:11:28,326 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 14:11:28,327 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 14:11:28,327 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 14:11:28,328 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 14:11:28,331 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 14:11:28,332 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,333 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eef371a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28, skipping insertion in model container [2024-10-14 14:11:28,333 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,361 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 14:11:28,482 WARN L248 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_variablewrapping_wrapper-sp_file-8.i[916,929] [2024-10-14 14:11:28,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:11:28,553 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 14:11:28,563 WARN L248 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_variablewrapping_wrapper-sp_file-8.i[916,929] [2024-10-14 14:11:28,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 14:11:28,636 INFO L204 MainTranslator]: Completed translation [2024-10-14 14:11:28,637 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28 WrapperNode [2024-10-14 14:11:28,637 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 14:11:28,638 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 14:11:28,638 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 14:11:28,639 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 14:11:28,643 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,662 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,697 INFO L138 Inliner]: procedures = 29, calls = 152, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 456 [2024-10-14 14:11:28,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 14:11:28,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 14:11:28,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 14:11:28,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 14:11:28,707 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,711 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,726 INFO L175 MemorySlicer]: Split 126 memory accesses to 2 slices as follows [2, 124]. 98 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 15]. The 19 writes are split as follows [0, 19]. [2024-10-14 14:11:28,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,726 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,748 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,751 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,758 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,760 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,765 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 14:11:28,766 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 14:11:28,766 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 14:11:28,766 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 14:11:28,767 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (1/1) ... [2024-10-14 14:11:28,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 14:11:28,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 14:11:28,809 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-10-14 14:11:28,819 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-10-14 14:11:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 14:11:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 14:11:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 14:11:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-14 14:11:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-14 14:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-14 14:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-14 14:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 14:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 14:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-14 14:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-14 14:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 14:11:28,867 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 14:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 14:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 14:11:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 14:11:28,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 14:11:28,971 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 14:11:28,974 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 14:11:29,359 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-14 14:11:29,360 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 14:11:29,404 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 14:11:29,404 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 14:11:29,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:11:29 BoogieIcfgContainer [2024-10-14 14:11:29,408 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 14:11:29,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 14:11:29,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 14:11:29,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 14:11:29,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:11:28" (1/3) ... [2024-10-14 14:11:29,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd7df6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:11:29, skipping insertion in model container [2024-10-14 14:11:29,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:11:28" (2/3) ... [2024-10-14 14:11:29,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fd7df6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:11:29, skipping insertion in model container [2024-10-14 14:11:29,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:11:29" (3/3) ... [2024-10-14 14:11:29,418 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-sp_file-8.i [2024-10-14 14:11:29,441 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 14:11:29,444 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 14:11:29,503 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 14:11:29,508 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;@4f2bbf7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 14:11:29,508 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 14:11:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 93 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 14:11:29,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 14:11:29,520 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:29,520 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 14:11:29,521 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:29,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:29,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1665721735, now seen corresponding path program 1 times [2024-10-14 14:11:29,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:29,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551656010] [2024-10-14 14:11:29,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:29,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:29,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:29,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:29,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:11:29,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:11:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:11:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:11:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:11:29,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:11:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:11:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:29,848 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 14:11:29,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:29,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551656010] [2024-10-14 14:11:29,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551656010] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:29,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:29,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 14:11:29,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683202722] [2024-10-14 14:11:29,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:29,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 14:11:29,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:29,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 14:11:29,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 14:11:29,877 INFO L87 Difference]: Start difference. First operand has 93 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 77 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 14:11:30,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:30,008 INFO L93 Difference]: Finished difference Result 183 states and 288 transitions. [2024-10-14 14:11:30,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 14:11:30,014 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 118 [2024-10-14 14:11:30,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:30,019 INFO L225 Difference]: With dead ends: 183 [2024-10-14 14:11:30,019 INFO L226 Difference]: Without dead ends: 91 [2024-10-14 14:11:30,022 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-10-14 14:11:30,026 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:30,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:11:30,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-14 14:11:30,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-10-14 14:11:30,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 75 states have (on average 1.4) internal successors, (105), 75 states have internal predecessors, (105), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 14:11:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 133 transitions. [2024-10-14 14:11:30,068 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 133 transitions. Word has length 118 [2024-10-14 14:11:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:30,069 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 133 transitions. [2024-10-14 14:11:30,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.5) internal successors, (51), 2 states have internal predecessors, (51), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 14:11:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 133 transitions. [2024-10-14 14:11:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 14:11:30,071 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:30,071 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 14:11:30,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 14:11:30,072 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:30,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:30,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1494754021, now seen corresponding path program 1 times [2024-10-14 14:11:30,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:30,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890663502] [2024-10-14 14:11:30,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:30,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:30,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:30,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:30,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:30,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:11:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:11:30,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:11:30,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:11:30,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:11:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:11:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:11:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,345 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 14:11:30,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:30,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890663502] [2024-10-14 14:11:30,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890663502] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:30,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:30,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:11:30,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306331216] [2024-10-14 14:11:30,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:30,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:11:30,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:30,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:11:30,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:11:30,348 INFO L87 Difference]: Start difference. First operand 91 states and 133 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 14:11:30,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:30,415 INFO L93 Difference]: Finished difference Result 184 states and 269 transitions. [2024-10-14 14:11:30,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:11:30,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-14 14:11:30,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:30,420 INFO L225 Difference]: With dead ends: 184 [2024-10-14 14:11:30,421 INFO L226 Difference]: Without dead ends: 94 [2024-10-14 14:11:30,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:11:30,423 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:30,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 371 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:11:30,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-14 14:11:30,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2024-10-14 14:11:30,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 77 states have internal predecessors, (107), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 14:11:30,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-10-14 14:11:30,439 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 118 [2024-10-14 14:11:30,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:30,441 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-10-14 14:11:30,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 14:11:30,441 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-10-14 14:11:30,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 14:11:30,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:30,444 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 14:11:30,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 14:11:30,444 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:30,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:30,445 INFO L85 PathProgramCache]: Analyzing trace with hash 685407395, now seen corresponding path program 1 times [2024-10-14 14:11:30,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:30,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771816379] [2024-10-14 14:11:30,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:30,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:30,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:30,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:30,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:11:30,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:11:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:11:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:11:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:11:30,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:11:30,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:11:30,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 14:11:30,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:30,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771816379] [2024-10-14 14:11:30,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771816379] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:30,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:30,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:11:30,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467374284] [2024-10-14 14:11:30,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:30,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:11:30,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:30,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:11:30,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:11:30,667 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 14:11:30,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:30,706 INFO L93 Difference]: Finished difference Result 188 states and 273 transitions. [2024-10-14 14:11:30,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:11:30,707 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-14 14:11:30,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:30,708 INFO L225 Difference]: With dead ends: 188 [2024-10-14 14:11:30,708 INFO L226 Difference]: Without dead ends: 96 [2024-10-14 14:11:30,710 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:11:30,711 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 1 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:30,711 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 372 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 14:11:30,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-10-14 14:11:30,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-10-14 14:11:30,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 79 states have (on average 1.379746835443038) internal successors, (109), 79 states have internal predecessors, (109), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 14:11:30,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-10-14 14:11:30,719 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 118 [2024-10-14 14:11:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:30,720 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-10-14 14:11:30,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 14:11:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-10-14 14:11:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 14:11:30,722 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:30,723 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 14:11:30,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 14:11:30,724 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:30,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:30,724 INFO L85 PathProgramCache]: Analyzing trace with hash 742665697, now seen corresponding path program 1 times [2024-10-14 14:11:30,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:30,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431582511] [2024-10-14 14:11:30,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:30,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:30,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:30,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:30,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:11:30,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:11:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:11:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:11:30,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:11:30,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:11:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:11:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:30,917 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 14:11:30,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:30,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431582511] [2024-10-14 14:11:30,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431582511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:30,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:30,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 14:11:30,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753995980] [2024-10-14 14:11:30,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:30,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 14:11:30,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:30,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 14:11:30,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:11:30,920 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 14:11:30,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:30,989 INFO L93 Difference]: Finished difference Result 192 states and 277 transitions. [2024-10-14 14:11:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 14:11:30,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-14 14:11:30,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:30,991 INFO L225 Difference]: With dead ends: 192 [2024-10-14 14:11:30,991 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 14:11:30,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 14:11:30,992 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 1 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:30,992 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 375 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:11:30,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 14:11:31,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-14 14:11:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.3703703703703705) internal successors, (111), 81 states have internal predecessors, (111), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 14:11:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 139 transitions. [2024-10-14 14:11:31,004 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 139 transitions. Word has length 118 [2024-10-14 14:11:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:31,004 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 139 transitions. [2024-10-14 14:11:31,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 14:11:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 139 transitions. [2024-10-14 14:11:31,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 14:11:31,009 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:31,009 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 14:11:31,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 14:11:31,009 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:31,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:31,009 INFO L85 PathProgramCache]: Analyzing trace with hash 742725279, now seen corresponding path program 1 times [2024-10-14 14:11:31,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:31,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580987728] [2024-10-14 14:11:31,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:31,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:32,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:11:32,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:11:32,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:11:32,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:11:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:11:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:11:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:11:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:32,247 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 14:11:32,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:32,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580987728] [2024-10-14 14:11:32,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580987728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:32,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:32,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 14:11:32,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532755430] [2024-10-14 14:11:32,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:32,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:11:32,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:32,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:11:32,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:11:32,251 INFO L87 Difference]: Start difference. First operand 97 states and 139 transitions. Second operand has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 14:11:32,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:32,588 INFO L93 Difference]: Finished difference Result 194 states and 278 transitions. [2024-10-14 14:11:32,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:11:32,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2024-10-14 14:11:32,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:32,590 INFO L225 Difference]: With dead ends: 194 [2024-10-14 14:11:32,590 INFO L226 Difference]: Without dead ends: 98 [2024-10-14 14:11:32,590 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-14 14:11:32,591 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 248 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:32,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 268 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:11:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-14 14:11:32,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2024-10-14 14:11:32,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 81 states have (on average 1.3580246913580247) internal successors, (110), 81 states have internal predecessors, (110), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 14:11:32,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2024-10-14 14:11:32,600 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 118 [2024-10-14 14:11:32,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:32,601 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2024-10-14 14:11:32,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-14 14:11:32,601 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2024-10-14 14:11:32,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-14 14:11:32,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:32,602 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 14:11:32,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 14:11:32,602 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:32,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:32,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1251419427, now seen corresponding path program 1 times [2024-10-14 14:11:32,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:32,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000766987] [2024-10-14 14:11:32,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:32,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:32,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:33,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:33,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:33,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:11:33,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:11:33,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:11:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:11:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:11:33,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:11:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:11:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 14:11:33,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:33,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000766987] [2024-10-14 14:11:33,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000766987] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:33,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:33,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 14:11:33,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391438849] [2024-10-14 14:11:33,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:33,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 14:11:33,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:33,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 14:11:33,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 14:11:33,048 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 14:11:33,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:33,206 INFO L93 Difference]: Finished difference Result 229 states and 323 transitions. [2024-10-14 14:11:33,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 14:11:33,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 118 [2024-10-14 14:11:33,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:33,207 INFO L225 Difference]: With dead ends: 229 [2024-10-14 14:11:33,207 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 14:11:33,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:11:33,208 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 142 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 452 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:33,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 452 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 14:11:33,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 14:11:33,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2024-10-14 14:11:33,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3529411764705883) internal successors, (115), 85 states have internal predecessors, (115), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 14:11:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 143 transitions. [2024-10-14 14:11:33,225 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 143 transitions. Word has length 118 [2024-10-14 14:11:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:33,226 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 143 transitions. [2024-10-14 14:11:33,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 states have internal predecessors, (51), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-14 14:11:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 143 transitions. [2024-10-14 14:11:33,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 14:11:33,228 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:33,228 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 14:11:33,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 14:11:33,228 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:33,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:33,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1680188958, now seen corresponding path program 1 times [2024-10-14 14:11:33,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:33,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119481651] [2024-10-14 14:11:33,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:33,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:34,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:34,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:11:34,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:11:34,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:11:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:11:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:11:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:11:34,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:11:34,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 14:11:34,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:34,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119481651] [2024-10-14 14:11:34,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119481651] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:34,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:34,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 14:11:34,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5278684] [2024-10-14 14:11:34,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:34,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 14:11:34,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:34,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 14:11:34,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-14 14:11:34,631 INFO L87 Difference]: Start difference. First operand 101 states and 143 transitions. Second operand has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 14:11:35,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:35,235 INFO L93 Difference]: Finished difference Result 233 states and 327 transitions. [2024-10-14 14:11:35,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 14:11:35,235 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-14 14:11:35,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:35,236 INFO L225 Difference]: With dead ends: 233 [2024-10-14 14:11:35,236 INFO L226 Difference]: Without dead ends: 133 [2024-10-14 14:11:35,237 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2024-10-14 14:11:35,237 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 266 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:35,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 357 Invalid, 450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 14:11:35,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-14 14:11:35,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2024-10-14 14:11:35,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3411764705882352) internal successors, (114), 85 states have internal predecessors, (114), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 14:11:35,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 142 transitions. [2024-10-14 14:11:35,249 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 142 transitions. Word has length 120 [2024-10-14 14:11:35,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:35,250 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 142 transitions. [2024-10-14 14:11:35,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.818181818181818) internal successors, (53), 11 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 14:11:35,250 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 142 transitions. [2024-10-14 14:11:35,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 14:11:35,251 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:35,251 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 14:11:35,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 14:11:35,251 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:35,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:35,252 INFO L85 PathProgramCache]: Analyzing trace with hash 559053122, now seen corresponding path program 1 times [2024-10-14 14:11:35,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:35,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475050548] [2024-10-14 14:11:35,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:35,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:35,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 14:11:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-14 14:11:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 14:11:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-14 14:11:35,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-14 14:11:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 14:11:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-14 14:11:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-14 14:11:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-14 14:11:35,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 14:11:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-14 14:11:35,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-14 14:11:35,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 14:11:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-14 14:11:35,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 14:11:35,906 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-14 14:11:35,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 14:11:35,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475050548] [2024-10-14 14:11:35,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475050548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 14:11:35,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 14:11:35,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 14:11:35,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775564712] [2024-10-14 14:11:35,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 14:11:35,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 14:11:35,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 14:11:35,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 14:11:35,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 14:11:35,908 INFO L87 Difference]: Start difference. First operand 101 states and 142 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 14:11:36,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 14:11:36,261 INFO L93 Difference]: Finished difference Result 227 states and 316 transitions. [2024-10-14 14:11:36,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 14:11:36,262 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2024-10-14 14:11:36,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 14:11:36,263 INFO L225 Difference]: With dead ends: 227 [2024-10-14 14:11:36,263 INFO L226 Difference]: Without dead ends: 127 [2024-10-14 14:11:36,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2024-10-14 14:11:36,264 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 299 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 14:11:36,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 248 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 14:11:36,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-10-14 14:11:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 101. [2024-10-14 14:11:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 85 states have (on average 1.3294117647058823) internal successors, (113), 85 states have internal predecessors, (113), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 14:11:36,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 141 transitions. [2024-10-14 14:11:36,275 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 141 transitions. Word has length 120 [2024-10-14 14:11:36,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 14:11:36,275 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 141 transitions. [2024-10-14 14:11:36,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-14 14:11:36,276 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 141 transitions. [2024-10-14 14:11:36,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-14 14:11:36,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 14:11:36,276 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-14 14:11:36,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 14:11:36,277 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 14:11:36,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 14:11:36,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1784272085, now seen corresponding path program 1 times [2024-10-14 14:11:36,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 14:11:36,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587468921] [2024-10-14 14:11:36,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 14:11:36,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 14:11:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat