./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_7.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_7.c -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.graphml --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 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-19 10:57:33,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-19 10:57:33,003 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-19 10:57:33,027 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-19 10:57:33,028 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-19 10:57:33,029 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-19 10:57:33,031 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-19 10:57:33,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-19 10:57:33,039 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-19 10:57:33,043 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-19 10:57:33,044 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-19 10:57:33,046 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-19 10:57:33,047 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-19 10:57:33,049 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-19 10:57:33,051 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-19 10:57:33,052 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-19 10:57:33,053 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-19 10:57:33,054 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-19 10:57:33,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-19 10:57:33,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-19 10:57:33,064 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-19 10:57:33,065 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-19 10:57:33,065 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-19 10:57:33,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-19 10:57:33,068 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-19 10:57:33,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-19 10:57:33,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-19 10:57:33,075 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-19 10:57:33,076 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-19 10:57:33,077 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-19 10:57:33,078 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-19 10:57:33,078 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-19 10:57:33,079 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-19 10:57:33,080 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-19 10:57:33,080 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-19 10:57:33,081 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-19 10:57:33,081 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-19 10:57:33,082 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-19 10:57:33,082 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-19 10:57:33,082 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-19 10:57:33,083 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-19 10:57:33,084 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-19 10:57:33,086 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-19 10:57:33,118 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-19 10:57:33,118 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-19 10:57:33,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-19 10:57:33,119 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-19 10:57:33,119 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-19 10:57:33,120 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-19 10:57:33,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-19 10:57:33,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-19 10:57:33,121 INFO L138 SettingsManager]: * Use SBE=true [2022-07-19 10:57:33,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-19 10:57:33,122 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-19 10:57:33,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-19 10:57:33,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-19 10:57:33,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-19 10:57:33,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-19 10:57:33,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-19 10:57:33,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-19 10:57:33,123 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-19 10:57:33,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-19 10:57:33,123 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-19 10:57:33,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-19 10:57:33,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-19 10:57:33,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-19 10:57:33,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-19 10:57:33,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:57:33,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-19 10:57:33,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-19 10:57:33,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-19 10:57:33,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-19 10:57:33,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-19 10:57:33,126 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-19 10:57:33,126 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-19 10:57:33,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-19 10:57:33,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 05c715fd95d2209519e9aa0425ca71b72050ac0ff5d332c8a9deb8ead8471230 [2022-07-19 10:57:33,331 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-19 10:57:33,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-19 10:57:33,362 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-19 10:57:33,364 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-19 10:57:33,364 INFO L275 PluginConnector]: CDTParser initialized [2022-07-19 10:57:33,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2022-07-19 10:57:33,436 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/400daccd9/1bba25c504e9452289ee89d5a7281cbd/FLAGcfca76d7d [2022-07-19 10:57:33,833 INFO L306 CDTParser]: Found 1 translation units. [2022-07-19 10:57:33,833 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2022-07-19 10:57:33,839 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/400daccd9/1bba25c504e9452289ee89d5a7281cbd/FLAGcfca76d7d [2022-07-19 10:57:34,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/400daccd9/1bba25c504e9452289ee89d5a7281cbd [2022-07-19 10:57:34,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-19 10:57:34,251 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-19 10:57:34,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-19 10:57:34,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-19 10:57:34,259 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-19 10:57:34,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:57:34" (1/1) ... [2022-07-19 10:57:34,261 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f8e68a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34, skipping insertion in model container [2022-07-19 10:57:34,261 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.07 10:57:34" (1/1) ... [2022-07-19 10:57:34,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-19 10:57:34,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-19 10:57:34,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2022-07-19 10:57:34,428 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:57:34,435 INFO L203 MainTranslator]: Completed pre-run [2022-07-19 10:57:34,451 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c[2881,2894] [2022-07-19 10:57:34,452 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-19 10:57:34,462 INFO L208 MainTranslator]: Completed translation [2022-07-19 10:57:34,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34 WrapperNode [2022-07-19 10:57:34,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-19 10:57:34,464 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-19 10:57:34,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-19 10:57:34,464 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-19 10:57:34,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34" (1/1) ... [2022-07-19 10:57:34,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34" (1/1) ... [2022-07-19 10:57:34,493 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 105 [2022-07-19 10:57:34,494 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-19 10:57:34,495 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-19 10:57:34,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-19 10:57:34,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-19 10:57:34,500 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34" (1/1) ... [2022-07-19 10:57:34,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34" (1/1) ... [2022-07-19 10:57:34,502 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34" (1/1) ... [2022-07-19 10:57:34,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34" (1/1) ... [2022-07-19 10:57:34,504 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34" (1/1) ... [2022-07-19 10:57:34,508 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34" (1/1) ... [2022-07-19 10:57:34,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34" (1/1) ... [2022-07-19 10:57:34,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-19 10:57:34,511 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-19 10:57:34,511 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-19 10:57:34,511 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-19 10:57:34,512 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34" (1/1) ... [2022-07-19 10:57:34,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-19 10:57:34,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-19 10:57:34,544 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-19 10:57:34,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-19 10:57:34,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-19 10:57:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-19 10:57:34,574 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-19 10:57:34,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-19 10:57:34,616 INFO L234 CfgBuilder]: Building ICFG [2022-07-19 10:57:34,618 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-19 10:57:34,744 INFO L275 CfgBuilder]: Performing block encoding [2022-07-19 10:57:34,749 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-19 10:57:34,749 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-19 10:57:34,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:57:34 BoogieIcfgContainer [2022-07-19 10:57:34,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-19 10:57:34,753 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-19 10:57:34,753 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-19 10:57:34,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-19 10:57:34,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.07 10:57:34" (1/3) ... [2022-07-19 10:57:34,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569b0135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:57:34, skipping insertion in model container [2022-07-19 10:57:34,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.07 10:57:34" (2/3) ... [2022-07-19 10:57:34,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@569b0135 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.07 10:57:34, skipping insertion in model container [2022-07-19 10:57:34,765 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:57:34" (3/3) ... [2022-07-19 10:57:34,766 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2022-07-19 10:57:34,778 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-19 10:57:34,781 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-19 10:57:34,826 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-19 10:57:34,831 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@37ecb75, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@182adaca [2022-07-19 10:57:34,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-19 10:57:34,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 10:57:34,840 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:34,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:34,841 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:34,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:34,846 INFO L85 PathProgramCache]: Analyzing trace with hash -882170869, now seen corresponding path program 1 times [2022-07-19 10:57:34,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:34,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360373240] [2022-07-19 10:57:34,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:34,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:34,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:34,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:34,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360373240] [2022-07-19 10:57:34,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360373240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:34,982 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:34,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:34,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639751321] [2022-07-19 10:57:34,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:34,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:34,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:35,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:35,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,021 INFO L87 Difference]: Start difference. First operand has 31 states, 29 states have (on average 1.8620689655172413) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:35,052 INFO L93 Difference]: Finished difference Result 65 states and 109 transitions. [2022-07-19 10:57:35,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:35,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-19 10:57:35,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:35,066 INFO L225 Difference]: With dead ends: 65 [2022-07-19 10:57:35,067 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 10:57:35,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,072 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 37 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:35,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 103 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 10:57:35,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2022-07-19 10:57:35,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 62 transitions. [2022-07-19 10:57:35,101 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 62 transitions. Word has length 14 [2022-07-19 10:57:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:35,102 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 62 transitions. [2022-07-19 10:57:35,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 62 transitions. [2022-07-19 10:57:35,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-19 10:57:35,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:35,103 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:35,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-19 10:57:35,104 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:35,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:35,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1275197879, now seen corresponding path program 1 times [2022-07-19 10:57:35,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:35,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319540634] [2022-07-19 10:57:35,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:35,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:35,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:35,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:35,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319540634] [2022-07-19 10:57:35,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319540634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:35,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:35,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:35,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447482870] [2022-07-19 10:57:35,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:35,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:35,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:35,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:35,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,163 INFO L87 Difference]: Start difference. First operand 35 states and 62 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:35,182 INFO L93 Difference]: Finished difference Result 84 states and 149 transitions. [2022-07-19 10:57:35,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:35,182 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-19 10:57:35,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:35,184 INFO L225 Difference]: With dead ends: 84 [2022-07-19 10:57:35,197 INFO L226 Difference]: Without dead ends: 51 [2022-07-19 10:57:35,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,199 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 33 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:35,200 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 101 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:35,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-07-19 10:57:35,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 49. [2022-07-19 10:57:35,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.7916666666666667) internal successors, (86), 48 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 86 transitions. [2022-07-19 10:57:35,207 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 86 transitions. Word has length 14 [2022-07-19 10:57:35,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:35,208 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 86 transitions. [2022-07-19 10:57:35,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,209 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 86 transitions. [2022-07-19 10:57:35,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 10:57:35,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:35,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:35,210 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-19 10:57:35,213 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:35,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:35,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1577278843, now seen corresponding path program 1 times [2022-07-19 10:57:35,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:35,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864289343] [2022-07-19 10:57:35,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:35,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:35,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:35,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:35,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:35,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864289343] [2022-07-19 10:57:35,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864289343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:35,287 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:35,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:35,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9790431] [2022-07-19 10:57:35,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:35,289 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:35,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:35,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:35,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,291 INFO L87 Difference]: Start difference. First operand 49 states and 86 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:35,316 INFO L93 Difference]: Finished difference Result 78 states and 132 transitions. [2022-07-19 10:57:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:35,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-19 10:57:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:35,318 INFO L225 Difference]: With dead ends: 78 [2022-07-19 10:57:35,318 INFO L226 Difference]: Without dead ends: 54 [2022-07-19 10:57:35,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,320 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 35 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:35,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 112 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-19 10:57:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-07-19 10:57:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.7254901960784315) internal successors, (88), 51 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 88 transitions. [2022-07-19 10:57:35,328 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 88 transitions. Word has length 15 [2022-07-19 10:57:35,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:35,328 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 88 transitions. [2022-07-19 10:57:35,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,329 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 88 transitions. [2022-07-19 10:57:35,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 10:57:35,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:35,330 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:35,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-19 10:57:35,330 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:35,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:35,331 INFO L85 PathProgramCache]: Analyzing trace with hash -876214265, now seen corresponding path program 1 times [2022-07-19 10:57:35,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:35,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172435088] [2022-07-19 10:57:35,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:35,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:35,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:35,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:35,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172435088] [2022-07-19 10:57:35,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172435088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:35,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:35,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:35,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723658455] [2022-07-19 10:57:35,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:35,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:35,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:35,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:35,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,373 INFO L87 Difference]: Start difference. First operand 52 states and 88 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:35,395 INFO L93 Difference]: Finished difference Result 97 states and 165 transitions. [2022-07-19 10:57:35,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:35,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-19 10:57:35,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:35,397 INFO L225 Difference]: With dead ends: 97 [2022-07-19 10:57:35,397 INFO L226 Difference]: Without dead ends: 95 [2022-07-19 10:57:35,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,399 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 30 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:35,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 89 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-19 10:57:35,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 69. [2022-07-19 10:57:35,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.7205882352941178) internal successors, (117), 68 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 117 transitions. [2022-07-19 10:57:35,409 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 117 transitions. Word has length 15 [2022-07-19 10:57:35,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:35,409 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 117 transitions. [2022-07-19 10:57:35,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,410 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 117 transitions. [2022-07-19 10:57:35,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-19 10:57:35,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:35,411 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:35,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-19 10:57:35,411 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:35,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:35,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1269241275, now seen corresponding path program 1 times [2022-07-19 10:57:35,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:35,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050493378] [2022-07-19 10:57:35,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:35,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:35,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:35,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:35,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050493378] [2022-07-19 10:57:35,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050493378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:35,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:35,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:35,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376427956] [2022-07-19 10:57:35,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:35,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:35,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:35,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:35,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,446 INFO L87 Difference]: Start difference. First operand 69 states and 117 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:35,461 INFO L93 Difference]: Finished difference Result 161 states and 275 transitions. [2022-07-19 10:57:35,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:35,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-19 10:57:35,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:35,463 INFO L225 Difference]: With dead ends: 161 [2022-07-19 10:57:35,463 INFO L226 Difference]: Without dead ends: 97 [2022-07-19 10:57:35,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,465 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:35,465 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 102 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:35,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-19 10:57:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-07-19 10:57:35,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.6914893617021276) internal successors, (159), 94 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 159 transitions. [2022-07-19 10:57:35,474 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 159 transitions. Word has length 15 [2022-07-19 10:57:35,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:35,475 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 159 transitions. [2022-07-19 10:57:35,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,475 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 159 transitions. [2022-07-19 10:57:35,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:57:35,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:35,476 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:35,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-19 10:57:35,477 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:35,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:35,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1392623778, now seen corresponding path program 1 times [2022-07-19 10:57:35,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:35,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881951953] [2022-07-19 10:57:35,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:35,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:35,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:35,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881951953] [2022-07-19 10:57:35,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881951953] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:35,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:35,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:35,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317454167] [2022-07-19 10:57:35,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:35,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:35,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:35,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:35,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,524 INFO L87 Difference]: Start difference. First operand 95 states and 159 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:35,538 INFO L93 Difference]: Finished difference Result 144 states and 238 transitions. [2022-07-19 10:57:35,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:35,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 10:57:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:35,540 INFO L225 Difference]: With dead ends: 144 [2022-07-19 10:57:35,540 INFO L226 Difference]: Without dead ends: 99 [2022-07-19 10:57:35,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,542 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 34 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:35,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 108 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:35,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-19 10:57:35,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2022-07-19 10:57:35,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.65625) internal successors, (159), 96 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 159 transitions. [2022-07-19 10:57:35,552 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 159 transitions. Word has length 16 [2022-07-19 10:57:35,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:35,552 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 159 transitions. [2022-07-19 10:57:35,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,553 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 159 transitions. [2022-07-19 10:57:35,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:57:35,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:35,554 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:35,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-19 10:57:35,554 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:35,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:35,555 INFO L85 PathProgramCache]: Analyzing trace with hash -691559200, now seen corresponding path program 1 times [2022-07-19 10:57:35,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:35,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262614495] [2022-07-19 10:57:35,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:35,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:35,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:35,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:35,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:35,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262614495] [2022-07-19 10:57:35,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262614495] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:35,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:35,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:35,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610945762] [2022-07-19 10:57:35,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:35,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:35,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:35,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:35,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,585 INFO L87 Difference]: Start difference. First operand 97 states and 159 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:35,604 INFO L93 Difference]: Finished difference Result 273 states and 449 transitions. [2022-07-19 10:57:35,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:35,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 10:57:35,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:35,606 INFO L225 Difference]: With dead ends: 273 [2022-07-19 10:57:35,606 INFO L226 Difference]: Without dead ends: 183 [2022-07-19 10:57:35,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,608 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:35,608 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 91 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-19 10:57:35,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2022-07-19 10:57:35,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.6166666666666667) internal successors, (291), 180 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 291 transitions. [2022-07-19 10:57:35,624 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 291 transitions. Word has length 16 [2022-07-19 10:57:35,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:35,624 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 291 transitions. [2022-07-19 10:57:35,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,625 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 291 transitions. [2022-07-19 10:57:35,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-19 10:57:35,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:35,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:35,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-19 10:57:35,626 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:35,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:35,627 INFO L85 PathProgramCache]: Analyzing trace with hash -298532190, now seen corresponding path program 1 times [2022-07-19 10:57:35,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:35,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526308532] [2022-07-19 10:57:35,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:35,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:35,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:35,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:35,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526308532] [2022-07-19 10:57:35,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526308532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:35,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:35,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:35,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588833838] [2022-07-19 10:57:35,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:35,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:35,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:35,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:35,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,655 INFO L87 Difference]: Start difference. First operand 181 states and 291 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:35,678 INFO L93 Difference]: Finished difference Result 225 states and 365 transitions. [2022-07-19 10:57:35,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:35,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-19 10:57:35,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:35,681 INFO L225 Difference]: With dead ends: 225 [2022-07-19 10:57:35,683 INFO L226 Difference]: Without dead ends: 223 [2022-07-19 10:57:35,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,685 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 27 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:35,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 116 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:35,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-07-19 10:57:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 181. [2022-07-19 10:57:35,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.5944444444444446) internal successors, (287), 180 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 287 transitions. [2022-07-19 10:57:35,753 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 287 transitions. Word has length 16 [2022-07-19 10:57:35,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:35,753 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 287 transitions. [2022-07-19 10:57:35,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,753 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 287 transitions. [2022-07-19 10:57:35,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 10:57:35,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:35,759 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:35,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-19 10:57:35,765 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:35,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:35,766 INFO L85 PathProgramCache]: Analyzing trace with hash 36716282, now seen corresponding path program 1 times [2022-07-19 10:57:35,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:35,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387219208] [2022-07-19 10:57:35,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:35,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:35,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:35,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:35,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387219208] [2022-07-19 10:57:35,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387219208] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:35,804 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:35,804 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:35,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595077076] [2022-07-19 10:57:35,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:35,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:35,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:35,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:35,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,806 INFO L87 Difference]: Start difference. First operand 181 states and 287 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:35,818 INFO L93 Difference]: Finished difference Result 325 states and 521 transitions. [2022-07-19 10:57:35,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:35,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-19 10:57:35,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:35,820 INFO L225 Difference]: With dead ends: 325 [2022-07-19 10:57:35,820 INFO L226 Difference]: Without dead ends: 323 [2022-07-19 10:57:35,821 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,822 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 24 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:35,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 85 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-19 10:57:35,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 257. [2022-07-19 10:57:35,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 256 states have (on average 1.55859375) internal successors, (399), 256 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 399 transitions. [2022-07-19 10:57:35,848 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 399 transitions. Word has length 17 [2022-07-19 10:57:35,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:35,848 INFO L495 AbstractCegarLoop]: Abstraction has 257 states and 399 transitions. [2022-07-19 10:57:35,848 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,848 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 399 transitions. [2022-07-19 10:57:35,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-19 10:57:35,850 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:35,850 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:35,850 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-19 10:57:35,850 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:35,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:35,851 INFO L85 PathProgramCache]: Analyzing trace with hash -356310728, now seen corresponding path program 1 times [2022-07-19 10:57:35,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:35,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529968054] [2022-07-19 10:57:35,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:35,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:35,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:35,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:35,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529968054] [2022-07-19 10:57:35,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529968054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:35,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:35,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:35,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646119566] [2022-07-19 10:57:35,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:35,875 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:35,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:35,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:35,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,883 INFO L87 Difference]: Start difference. First operand 257 states and 399 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:35,920 INFO L93 Difference]: Finished difference Result 597 states and 929 transitions. [2022-07-19 10:57:35,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:35,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-19 10:57:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:35,922 INFO L225 Difference]: With dead ends: 597 [2022-07-19 10:57:35,922 INFO L226 Difference]: Without dead ends: 347 [2022-07-19 10:57:35,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:35,924 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 30 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:35,925 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 104 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:35,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-19 10:57:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2022-07-19 10:57:35,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 1.5203488372093024) internal successors, (523), 344 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 523 transitions. [2022-07-19 10:57:35,954 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 523 transitions. Word has length 17 [2022-07-19 10:57:35,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:35,954 INFO L495 AbstractCegarLoop]: Abstraction has 345 states and 523 transitions. [2022-07-19 10:57:35,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:35,954 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 523 transitions. [2022-07-19 10:57:35,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 10:57:35,956 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:35,956 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:35,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-19 10:57:35,956 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:35,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:35,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1138420085, now seen corresponding path program 1 times [2022-07-19 10:57:35,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:35,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370555040] [2022-07-19 10:57:35,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:35,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:35,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:36,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:36,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:36,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370555040] [2022-07-19 10:57:36,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370555040] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:36,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:36,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:36,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392134575] [2022-07-19 10:57:36,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:36,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:36,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:36,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:36,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,003 INFO L87 Difference]: Start difference. First operand 345 states and 523 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:36,036 INFO L93 Difference]: Finished difference Result 525 states and 793 transitions. [2022-07-19 10:57:36,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:36,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-19 10:57:36,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:36,039 INFO L225 Difference]: With dead ends: 525 [2022-07-19 10:57:36,039 INFO L226 Difference]: Without dead ends: 359 [2022-07-19 10:57:36,040 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,044 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 32 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:36,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 100 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:36,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-07-19 10:57:36,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2022-07-19 10:57:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 356 states have (on average 1.4915730337078652) internal successors, (531), 356 states have internal predecessors, (531), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 531 transitions. [2022-07-19 10:57:36,072 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 531 transitions. Word has length 18 [2022-07-19 10:57:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:36,073 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 531 transitions. [2022-07-19 10:57:36,073 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,073 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 531 transitions. [2022-07-19 10:57:36,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 10:57:36,081 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:36,081 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:36,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-19 10:57:36,082 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:36,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:36,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1839484663, now seen corresponding path program 1 times [2022-07-19 10:57:36,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:36,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832009401] [2022-07-19 10:57:36,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:36,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:36,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:36,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832009401] [2022-07-19 10:57:36,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832009401] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:36,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:36,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:36,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709941968] [2022-07-19 10:57:36,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:36,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:36,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:36,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:36,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,117 INFO L87 Difference]: Start difference. First operand 357 states and 531 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:36,132 INFO L93 Difference]: Finished difference Result 617 states and 925 transitions. [2022-07-19 10:57:36,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:36,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-19 10:57:36,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:36,135 INFO L225 Difference]: With dead ends: 617 [2022-07-19 10:57:36,135 INFO L226 Difference]: Without dead ends: 615 [2022-07-19 10:57:36,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,136 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:36,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 83 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2022-07-19 10:57:36,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 517. [2022-07-19 10:57:36,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 517 states, 516 states have (on average 1.447674418604651) internal successors, (747), 516 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 747 transitions. [2022-07-19 10:57:36,165 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 747 transitions. Word has length 18 [2022-07-19 10:57:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:36,165 INFO L495 AbstractCegarLoop]: Abstraction has 517 states and 747 transitions. [2022-07-19 10:57:36,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 747 transitions. [2022-07-19 10:57:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-19 10:57:36,167 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:36,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:36,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-19 10:57:36,167 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:36,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:36,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1446457653, now seen corresponding path program 1 times [2022-07-19 10:57:36,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:36,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668902391] [2022-07-19 10:57:36,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:36,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:36,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:36,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:36,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668902391] [2022-07-19 10:57:36,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668902391] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:36,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:36,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:36,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250416612] [2022-07-19 10:57:36,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:36,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:36,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:36,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:36,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,203 INFO L87 Difference]: Start difference. First operand 517 states and 747 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:36,226 INFO L93 Difference]: Finished difference Result 1177 states and 1693 transitions. [2022-07-19 10:57:36,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:36,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-19 10:57:36,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:36,229 INFO L225 Difference]: With dead ends: 1177 [2022-07-19 10:57:36,229 INFO L226 Difference]: Without dead ends: 679 [2022-07-19 10:57:36,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,232 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:36,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:36,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2022-07-19 10:57:36,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 677. [2022-07-19 10:57:36,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 676 states have (on average 1.400887573964497) internal successors, (947), 676 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 947 transitions. [2022-07-19 10:57:36,251 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 947 transitions. Word has length 18 [2022-07-19 10:57:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:36,253 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 947 transitions. [2022-07-19 10:57:36,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,253 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 947 transitions. [2022-07-19 10:57:36,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 10:57:36,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:36,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:36,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-19 10:57:36,255 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:36,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:36,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1189665389, now seen corresponding path program 1 times [2022-07-19 10:57:36,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:36,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126201345] [2022-07-19 10:57:36,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:36,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:36,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:36,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:36,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126201345] [2022-07-19 10:57:36,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126201345] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:36,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:36,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:36,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613964664] [2022-07-19 10:57:36,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:36,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:36,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:36,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:36,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,286 INFO L87 Difference]: Start difference. First operand 677 states and 947 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:36,304 INFO L93 Difference]: Finished difference Result 1017 states and 1413 transitions. [2022-07-19 10:57:36,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:36,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-19 10:57:36,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:36,307 INFO L225 Difference]: With dead ends: 1017 [2022-07-19 10:57:36,315 INFO L226 Difference]: Without dead ends: 695 [2022-07-19 10:57:36,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,317 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 31 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:36,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 96 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:36,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-07-19 10:57:36,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2022-07-19 10:57:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.3684971098265897) internal successors, (947), 692 states have internal predecessors, (947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 947 transitions. [2022-07-19 10:57:36,337 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 947 transitions. Word has length 19 [2022-07-19 10:57:36,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:36,338 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 947 transitions. [2022-07-19 10:57:36,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,338 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 947 transitions. [2022-07-19 10:57:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 10:57:36,340 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:36,340 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:36,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-19 10:57:36,340 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:36,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1890729967, now seen corresponding path program 1 times [2022-07-19 10:57:36,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:36,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596555695] [2022-07-19 10:57:36,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:36,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:36,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:36,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:36,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596555695] [2022-07-19 10:57:36,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1596555695] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:36,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:36,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:36,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85767686] [2022-07-19 10:57:36,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:36,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:36,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:36,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:36,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,384 INFO L87 Difference]: Start difference. First operand 693 states and 947 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:36,416 INFO L93 Difference]: Finished difference Result 1161 states and 1589 transitions. [2022-07-19 10:57:36,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:36,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-19 10:57:36,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:36,421 INFO L225 Difference]: With dead ends: 1161 [2022-07-19 10:57:36,421 INFO L226 Difference]: Without dead ends: 1159 [2022-07-19 10:57:36,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,424 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 18 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:36,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 81 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-07-19 10:57:36,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1029. [2022-07-19 10:57:36,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1029 states, 1028 states have (on average 1.325875486381323) internal successors, (1363), 1028 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1029 states to 1029 states and 1363 transitions. [2022-07-19 10:57:36,451 INFO L78 Accepts]: Start accepts. Automaton has 1029 states and 1363 transitions. Word has length 19 [2022-07-19 10:57:36,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:36,451 INFO L495 AbstractCegarLoop]: Abstraction has 1029 states and 1363 transitions. [2022-07-19 10:57:36,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1029 states and 1363 transitions. [2022-07-19 10:57:36,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-19 10:57:36,455 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:36,455 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:36,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-19 10:57:36,455 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:36,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1497702957, now seen corresponding path program 1 times [2022-07-19 10:57:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:36,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992660993] [2022-07-19 10:57:36,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:36,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:36,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:36,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:36,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:36,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992660993] [2022-07-19 10:57:36,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992660993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:36,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:36,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:36,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905414016] [2022-07-19 10:57:36,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:36,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:36,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:36,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:36,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,498 INFO L87 Difference]: Start difference. First operand 1029 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:36,529 INFO L93 Difference]: Finished difference Result 2313 states and 3029 transitions. [2022-07-19 10:57:36,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:36,530 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-19 10:57:36,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:36,534 INFO L225 Difference]: With dead ends: 2313 [2022-07-19 10:57:36,534 INFO L226 Difference]: Without dead ends: 1319 [2022-07-19 10:57:36,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,537 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:36,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 106 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:36,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2022-07-19 10:57:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1317. [2022-07-19 10:57:36,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1317 states, 1316 states have (on average 1.2667173252279635) internal successors, (1667), 1316 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1667 transitions. [2022-07-19 10:57:36,574 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1667 transitions. Word has length 19 [2022-07-19 10:57:36,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:36,574 INFO L495 AbstractCegarLoop]: Abstraction has 1317 states and 1667 transitions. [2022-07-19 10:57:36,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1667 transitions. [2022-07-19 10:57:36,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:57:36,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:36,576 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:36,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-19 10:57:36,577 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:36,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:36,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1516697142, now seen corresponding path program 1 times [2022-07-19 10:57:36,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:36,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740288220] [2022-07-19 10:57:36,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:36,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:36,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:36,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:36,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740288220] [2022-07-19 10:57:36,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740288220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:36,609 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:36,609 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:36,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067191191] [2022-07-19 10:57:36,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:36,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:36,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:36,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:36,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,611 INFO L87 Difference]: Start difference. First operand 1317 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:36,645 INFO L93 Difference]: Finished difference Result 1977 states and 2485 transitions. [2022-07-19 10:57:36,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:36,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-19 10:57:36,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:36,651 INFO L225 Difference]: With dead ends: 1977 [2022-07-19 10:57:36,652 INFO L226 Difference]: Without dead ends: 1351 [2022-07-19 10:57:36,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,653 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 30 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:36,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 92 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:36,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-07-19 10:57:36,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2022-07-19 10:57:36,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.236646884272997) internal successors, (1667), 1348 states have internal predecessors, (1667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 1667 transitions. [2022-07-19 10:57:36,688 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 1667 transitions. Word has length 20 [2022-07-19 10:57:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:36,688 INFO L495 AbstractCegarLoop]: Abstraction has 1349 states and 1667 transitions. [2022-07-19 10:57:36,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 1667 transitions. [2022-07-19 10:57:36,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:57:36,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:36,690 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:36,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-19 10:57:36,690 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:36,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:36,691 INFO L85 PathProgramCache]: Analyzing trace with hash -815632564, now seen corresponding path program 1 times [2022-07-19 10:57:36,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:36,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241559032] [2022-07-19 10:57:36,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:36,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:36,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:36,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:36,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241559032] [2022-07-19 10:57:36,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241559032] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:36,727 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:36,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:36,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662185500] [2022-07-19 10:57:36,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:36,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:36,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:36,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:36,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,729 INFO L87 Difference]: Start difference. First operand 1349 states and 1667 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:36,766 INFO L93 Difference]: Finished difference Result 2183 states and 2660 transitions. [2022-07-19 10:57:36,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:36,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-19 10:57:36,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:36,785 INFO L225 Difference]: With dead ends: 2183 [2022-07-19 10:57:36,785 INFO L226 Difference]: Without dead ends: 2181 [2022-07-19 10:57:36,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,788 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 14 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:36,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 78 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:36,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2181 states. [2022-07-19 10:57:36,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2181 to 2053. [2022-07-19 10:57:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2053 states, 2052 states have (on average 1.2022417153996101) internal successors, (2467), 2052 states have internal predecessors, (2467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2053 states to 2053 states and 2467 transitions. [2022-07-19 10:57:36,839 INFO L78 Accepts]: Start accepts. Automaton has 2053 states and 2467 transitions. Word has length 20 [2022-07-19 10:57:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:36,840 INFO L495 AbstractCegarLoop]: Abstraction has 2053 states and 2467 transitions. [2022-07-19 10:57:36,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,841 INFO L276 IsEmpty]: Start isEmpty. Operand 2053 states and 2467 transitions. [2022-07-19 10:57:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-19 10:57:36,843 INFO L187 NwaCegarLoop]: Found error trace [2022-07-19 10:57:36,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:36,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-19 10:57:36,844 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-19 10:57:36,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-19 10:57:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1208659574, now seen corresponding path program 1 times [2022-07-19 10:57:36,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-19 10:57:36,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242362378] [2022-07-19 10:57:36,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-19 10:57:36,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-19 10:57:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-19 10:57:36,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-19 10:57:36,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-19 10:57:36,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242362378] [2022-07-19 10:57:36,869 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242362378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-19 10:57:36,869 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-19 10:57:36,869 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-19 10:57:36,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143171299] [2022-07-19 10:57:36,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-19 10:57:36,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-19 10:57:36,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-19 10:57:36,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-19 10:57:36,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,871 INFO L87 Difference]: Start difference. First operand 2053 states and 2467 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-19 10:57:36,917 INFO L93 Difference]: Finished difference Result 4549 states and 5347 transitions. [2022-07-19 10:57:36,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-19 10:57:36,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-19 10:57:36,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-19 10:57:36,918 INFO L225 Difference]: With dead ends: 4549 [2022-07-19 10:57:36,918 INFO L226 Difference]: Without dead ends: 0 [2022-07-19 10:57:36,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-19 10:57:36,923 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 26 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-19 10:57:36,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 105 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-19 10:57:36,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-19 10:57:36,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-19 10:57:36,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-19 10:57:36,924 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2022-07-19 10:57:36,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-19 10:57:36,924 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-19 10:57:36,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-19 10:57:36,925 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-19 10:57:36,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-19 10:57:36,928 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-19 10:57:36,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-19 10:57:36,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-19 10:57:36,941 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,941 INFO L899 garLoopResultBuilder]: For program point L77-1(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,941 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,941 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2022-07-19 10:57:36,941 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-19 10:57:36,941 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-19 10:57:36,941 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,941 INFO L902 garLoopResultBuilder]: At program point L119(lines 7 123) the Hoare annotation is: true [2022-07-19 10:57:36,942 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 55) no Hoare annotation was computed. [2022-07-19 10:57:36,942 INFO L899 garLoopResultBuilder]: For program point L53-2(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,942 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,942 INFO L899 garLoopResultBuilder]: For program point L104(line 104) no Hoare annotation was computed. [2022-07-19 10:57:36,942 INFO L899 garLoopResultBuilder]: For program point L88-1(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,942 INFO L902 garLoopResultBuilder]: At program point L113-1(lines 32 118) the Hoare annotation is: true [2022-07-19 10:57:36,942 INFO L902 garLoopResultBuilder]: At program point L122(lines 6 123) the Hoare annotation is: true [2022-07-19 10:57:36,942 INFO L899 garLoopResultBuilder]: For program point L89(line 89) no Hoare annotation was computed. [2022-07-19 10:57:36,942 INFO L899 garLoopResultBuilder]: For program point L114(line 114) no Hoare annotation was computed. [2022-07-19 10:57:36,942 INFO L895 garLoopResultBuilder]: At program point L114-1(lines 7 123) the Hoare annotation is: false [2022-07-19 10:57:36,942 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,943 INFO L899 garLoopResultBuilder]: For program point L98-1(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,944 INFO L899 garLoopResultBuilder]: For program point L65-1(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,944 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-19 10:57:36,944 INFO L899 garLoopResultBuilder]: For program point L57-1(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,944 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 121) no Hoare annotation was computed. [2022-07-19 10:57:36,944 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2022-07-19 10:57:36,944 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-19 10:57:36,944 INFO L899 garLoopResultBuilder]: For program point L83-1(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,945 INFO L899 garLoopResultBuilder]: For program point L108-1(lines 32 118) no Hoare annotation was computed. [2022-07-19 10:57:36,945 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 36) no Hoare annotation was computed. [2022-07-19 10:57:36,945 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2022-07-19 10:57:36,945 INFO L899 garLoopResultBuilder]: For program point L109(line 109) no Hoare annotation was computed. [2022-07-19 10:57:36,949 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-19 10:57:36,952 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-19 10:57:36,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.07 10:57:36 BoogieIcfgContainer [2022-07-19 10:57:36,960 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-19 10:57:36,961 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-19 10:57:36,961 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-19 10:57:36,961 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-19 10:57:36,962 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.07 10:57:34" (3/4) ... [2022-07-19 10:57:36,965 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-19 10:57:36,976 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-19 10:57:36,976 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-19 10:57:36,976 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-19 10:57:36,976 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-19 10:57:37,012 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-19 10:57:37,012 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-19 10:57:37,012 INFO L158 Benchmark]: Toolchain (without parser) took 2761.21ms. Allocated memory was 115.3MB in the beginning and 180.4MB in the end (delta: 65.0MB). Free memory was 86.1MB in the beginning and 104.5MB in the end (delta: -18.5MB). Peak memory consumption was 46.4MB. Max. memory is 16.1GB. [2022-07-19 10:57:37,013 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 115.3MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:57:37,013 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.26ms. Allocated memory is still 115.3MB. Free memory was 85.7MB in the beginning and 89.4MB in the end (delta: -3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-19 10:57:37,013 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.41ms. Allocated memory is still 115.3MB. Free memory was 89.4MB in the beginning and 87.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-19 10:57:37,013 INFO L158 Benchmark]: Boogie Preprocessor took 14.77ms. Allocated memory is still 115.3MB. Free memory was 87.9MB in the beginning and 86.7MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-19 10:57:37,013 INFO L158 Benchmark]: RCFGBuilder took 240.53ms. Allocated memory is still 115.3MB. Free memory was 86.4MB in the beginning and 75.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-19 10:57:37,014 INFO L158 Benchmark]: TraceAbstraction took 2207.49ms. Allocated memory was 115.3MB in the beginning and 180.4MB in the end (delta: 65.0MB). Free memory was 75.1MB in the beginning and 107.7MB in the end (delta: -32.6MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. [2022-07-19 10:57:37,014 INFO L158 Benchmark]: Witness Printer took 50.92ms. Allocated memory is still 180.4MB. Free memory was 107.7MB in the beginning and 104.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-19 10:57:37,015 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 115.3MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.26ms. Allocated memory is still 115.3MB. Free memory was 85.7MB in the beginning and 89.4MB in the end (delta: -3.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.41ms. Allocated memory is still 115.3MB. Free memory was 89.4MB in the beginning and 87.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 14.77ms. Allocated memory is still 115.3MB. Free memory was 87.9MB in the beginning and 86.7MB in the end (delta: 1.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 240.53ms. Allocated memory is still 115.3MB. Free memory was 86.4MB in the beginning and 75.7MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2207.49ms. Allocated memory was 115.3MB in the beginning and 180.4MB in the end (delta: 65.0MB). Free memory was 75.1MB in the beginning and 107.7MB in the end (delta: -32.6MB). Peak memory consumption was 35.1MB. Max. memory is 16.1GB. * Witness Printer took 50.92ms. Allocated memory is still 180.4MB. Free memory was 107.7MB in the beginning and 104.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 121]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 543 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 543 mSDsluCounter, 1857 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 729 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 101 IncrementalHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1128 mSDtfsCounter, 101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2053occurred in iteration=18, InterpolantAutomatonStates: 57, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 137 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 326 NumberOfCodeBlocks, 326 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 307 ConstructedInterpolants, 0 QuantifiedInterpolants, 622 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-19 10:57:37,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE