./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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_12.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 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:46:34,906 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:46:34,907 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:46:34,927 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:46:34,928 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:46:34,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:46:34,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:46:34,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:46:34,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:46:34,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:46:34,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:46:34,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:46:34,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:46:34,942 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:46:34,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:46:34,944 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:46:34,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:46:34,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:46:34,946 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:46:34,947 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:46:34,948 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:46:34,949 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:46:34,949 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:46:34,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:46:34,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:46:34,962 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:46:34,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:46:34,962 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:46:34,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:46:34,963 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:46:34,964 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:46:34,964 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:46:34,965 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:46:34,966 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:46:34,966 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:46:34,967 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:46:34,967 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:46:34,967 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:46:34,968 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:46:34,968 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:46:34,969 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:46:34,969 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:46:34,970 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:46:34,987 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:46:34,991 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:46:34,992 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:46:34,992 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:46:34,992 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:46:34,993 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:46:34,993 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:46:34,993 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:46:34,993 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:46:34,994 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:46:34,994 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:46:34,994 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:46:34,994 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:46:34,995 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:46:34,995 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:46:34,995 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:46:34,995 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:46:34,995 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:46:34,995 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:46:34,996 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:46:34,996 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:46:34,996 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:46:34,996 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:46:34,996 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:46:34,996 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:46:34,997 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:46:34,997 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:46:34,997 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:46:34,997 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:46:34,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:46:34,997 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:46:34,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:46:34,998 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:46:34,998 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 -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2022-07-11 23:46:35,170 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:46:35,182 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:46:35,184 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:46:35,185 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:46:35,185 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:46:35,186 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2022-07-11 23:46:35,223 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3d3cd46/02ce9aa3815d4f17b845bb9021114fa1/FLAGbfbe17c9b [2022-07-11 23:46:35,580 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:46:35,581 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2022-07-11 23:46:35,586 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3d3cd46/02ce9aa3815d4f17b845bb9021114fa1/FLAGbfbe17c9b [2022-07-11 23:46:35,594 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3d3cd46/02ce9aa3815d4f17b845bb9021114fa1 [2022-07-11 23:46:35,596 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:46:35,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:46:35,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:46:35,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:46:35,602 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:46:35,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:46:35" (1/1) ... [2022-07-11 23:46:35,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ffbb9d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35, skipping insertion in model container [2022-07-11 23:46:35,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:46:35" (1/1) ... [2022-07-11 23:46:35,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:46:35,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:46:35,795 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_12.c[4591,4604] [2022-07-11 23:46:35,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:46:35,810 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:46:35,837 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_12.c[4591,4604] [2022-07-11 23:46:35,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:46:35,848 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:46:35,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35 WrapperNode [2022-07-11 23:46:35,849 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:46:35,850 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:46:35,850 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:46:35,850 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:46:35,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35" (1/1) ... [2022-07-11 23:46:35,859 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35" (1/1) ... [2022-07-11 23:46:35,872 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 160 [2022-07-11 23:46:35,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:46:35,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:46:35,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:46:35,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:46:35,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35" (1/1) ... [2022-07-11 23:46:35,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35" (1/1) ... [2022-07-11 23:46:35,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35" (1/1) ... [2022-07-11 23:46:35,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35" (1/1) ... [2022-07-11 23:46:35,882 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35" (1/1) ... [2022-07-11 23:46:35,885 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35" (1/1) ... [2022-07-11 23:46:35,886 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35" (1/1) ... [2022-07-11 23:46:35,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:46:35,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:46:35,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:46:35,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:46:35,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35" (1/1) ... [2022-07-11 23:46:35,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:46:35,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:46:35,920 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-11 23:46:35,926 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-11 23:46:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:46:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:46:35,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:46:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:46:35,993 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:46:35,994 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:46:36,192 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:46:36,196 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:46:36,196 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-11 23:46:36,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:46:36 BoogieIcfgContainer [2022-07-11 23:46:36,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:46:36,199 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:46:36,199 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:46:36,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:46:36,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:46:35" (1/3) ... [2022-07-11 23:46:36,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2930dbfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:46:36, skipping insertion in model container [2022-07-11 23:46:36,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:46:35" (2/3) ... [2022-07-11 23:46:36,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2930dbfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:46:36, skipping insertion in model container [2022-07-11 23:46:36,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:46:36" (3/3) ... [2022-07-11 23:46:36,221 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_12.c [2022-07-11 23:46:36,231 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:46:36,237 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:46:36,289 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:46:36,293 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@39aef5fe, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@42e1abe2 [2022-07-11 23:46:36,294 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:46:36,297 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 45 states have internal predecessors, (84), 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-11 23:46:36,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-11 23:46:36,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:36,301 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-11 23:46:36,302 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:36,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:36,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1341605783, now seen corresponding path program 1 times [2022-07-11 23:46:36,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:36,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554428150] [2022-07-11 23:46:36,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:36,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:36,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:36,495 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-11 23:46:36,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:36,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554428150] [2022-07-11 23:46:36,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554428150] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:36,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:36,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784081497] [2022-07-11 23:46:36,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:36,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:36,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:36,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:36,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:36,525 INFO L87 Difference]: Start difference. First operand has 46 states, 44 states have (on average 1.9090909090909092) internal successors, (84), 45 states have internal predecessors, (84), 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 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-11 23:46:36,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:36,559 INFO L93 Difference]: Finished difference Result 95 states and 169 transitions. [2022-07-11 23:46:36,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:36,561 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-11 23:46:36,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:36,567 INFO L225 Difference]: With dead ends: 95 [2022-07-11 23:46:36,568 INFO L226 Difference]: Without dead ends: 81 [2022-07-11 23:46:36,569 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-11 23:46:36,571 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 62 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 163 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-11 23:46:36,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-11 23:46:36,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 55. [2022-07-11 23:46:36,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.8888888888888888) internal successors, (102), 54 states have internal predecessors, (102), 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-11 23:46:36,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 102 transitions. [2022-07-11 23:46:36,611 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 102 transitions. Word has length 19 [2022-07-11 23:46:36,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:36,611 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 102 transitions. [2022-07-11 23:46:36,612 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-11 23:46:36,612 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 102 transitions. [2022-07-11 23:46:36,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-11 23:46:36,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:36,613 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-11 23:46:36,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:46:36,614 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:36,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:36,615 INFO L85 PathProgramCache]: Analyzing trace with hash 61742105, now seen corresponding path program 1 times [2022-07-11 23:46:36,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:36,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406844505] [2022-07-11 23:46:36,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:36,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:36,680 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-11 23:46:36,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:36,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406844505] [2022-07-11 23:46:36,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406844505] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:36,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:36,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:36,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696402944] [2022-07-11 23:46:36,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:36,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:36,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:36,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:36,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:36,687 INFO L87 Difference]: Start difference. First operand 55 states and 102 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-11 23:46:36,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:36,709 INFO L93 Difference]: Finished difference Result 134 states and 249 transitions. [2022-07-11 23:46:36,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:36,711 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-11 23:46:36,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:36,712 INFO L225 Difference]: With dead ends: 134 [2022-07-11 23:46:36,712 INFO L226 Difference]: Without dead ends: 81 [2022-07-11 23:46:36,713 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-11 23:46:36,714 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 58 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 171 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-11 23:46:36,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 171 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:36,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-11 23:46:36,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-07-11 23:46:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.8717948717948718) internal successors, (146), 78 states have internal predecessors, (146), 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-11 23:46:36,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 146 transitions. [2022-07-11 23:46:36,721 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 146 transitions. Word has length 19 [2022-07-11 23:46:36,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:36,721 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 146 transitions. [2022-07-11 23:46:36,721 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-11 23:46:36,721 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 146 transitions. [2022-07-11 23:46:36,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:46:36,722 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:36,722 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-11 23:46:36,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:46:36,722 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:36,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:36,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1359680987, now seen corresponding path program 1 times [2022-07-11 23:46:36,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:36,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021506588] [2022-07-11 23:46:36,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:36,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:36,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:36,762 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-11 23:46:36,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:36,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021506588] [2022-07-11 23:46:36,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021506588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:36,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:36,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:36,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755310822] [2022-07-11 23:46:36,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:36,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:36,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:36,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:36,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:36,764 INFO L87 Difference]: Start difference. First operand 79 states and 146 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-11 23:46:36,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:36,778 INFO L93 Difference]: Finished difference Result 123 states and 222 transitions. [2022-07-11 23:46:36,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:36,779 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-11 23:46:36,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:36,780 INFO L225 Difference]: With dead ends: 123 [2022-07-11 23:46:36,780 INFO L226 Difference]: Without dead ends: 84 [2022-07-11 23:46:36,780 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-11 23:46:36,781 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 60 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 192 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-11 23:46:36,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 192 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:36,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-07-11 23:46:36,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2022-07-11 23:46:36,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 81 states have (on average 1.8271604938271604) internal successors, (148), 81 states have internal predecessors, (148), 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-11 23:46:36,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 148 transitions. [2022-07-11 23:46:36,787 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 148 transitions. Word has length 20 [2022-07-11 23:46:36,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:36,787 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 148 transitions. [2022-07-11 23:46:36,787 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-11 23:46:36,787 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 148 transitions. [2022-07-11 23:46:36,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:46:36,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:36,788 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-11 23:46:36,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-11 23:46:36,788 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:36,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:36,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1914217955, now seen corresponding path program 1 times [2022-07-11 23:46:36,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:36,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679242320] [2022-07-11 23:46:36,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:36,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:36,817 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-11 23:46:36,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:36,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679242320] [2022-07-11 23:46:36,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679242320] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:36,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:36,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:36,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730599343] [2022-07-11 23:46:36,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:36,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:36,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:36,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:36,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:36,820 INFO L87 Difference]: Start difference. First operand 82 states and 148 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-11 23:46:36,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:36,833 INFO L93 Difference]: Finished difference Result 157 states and 285 transitions. [2022-07-11 23:46:36,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:36,833 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-11 23:46:36,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:36,834 INFO L225 Difference]: With dead ends: 157 [2022-07-11 23:46:36,834 INFO L226 Difference]: Without dead ends: 155 [2022-07-11 23:46:36,834 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-11 23:46:36,835 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 55 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 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-11 23:46:36,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:36,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-11 23:46:36,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 109. [2022-07-11 23:46:36,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.8240740740740742) internal successors, (197), 108 states have internal predecessors, (197), 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-11 23:46:36,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 197 transitions. [2022-07-11 23:46:36,843 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 197 transitions. Word has length 20 [2022-07-11 23:46:36,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:36,843 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 197 transitions. [2022-07-11 23:46:36,843 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-11 23:46:36,843 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 197 transitions. [2022-07-11 23:46:36,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:46:36,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:36,844 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-11 23:46:36,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-11 23:46:36,844 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:36,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:36,844 INFO L85 PathProgramCache]: Analyzing trace with hash 634354277, now seen corresponding path program 1 times [2022-07-11 23:46:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:36,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123245887] [2022-07-11 23:46:36,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:36,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:36,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:36,870 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-11 23:46:36,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:36,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123245887] [2022-07-11 23:46:36,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123245887] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:36,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:36,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:36,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326436458] [2022-07-11 23:46:36,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:36,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:36,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:36,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:36,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:36,872 INFO L87 Difference]: Start difference. First operand 109 states and 197 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-11 23:46:36,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:36,883 INFO L93 Difference]: Finished difference Result 261 states and 475 transitions. [2022-07-11 23:46:36,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:36,884 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-11 23:46:36,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:36,884 INFO L225 Difference]: With dead ends: 261 [2022-07-11 23:46:36,884 INFO L226 Difference]: Without dead ends: 157 [2022-07-11 23:46:36,885 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-11 23:46:36,886 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 172 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-11 23:46:36,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 172 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:36,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-07-11 23:46:36,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2022-07-11 23:46:36,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 154 states have (on average 1.8116883116883118) internal successors, (279), 154 states have internal predecessors, (279), 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-11 23:46:36,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 279 transitions. [2022-07-11 23:46:36,904 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 279 transitions. Word has length 20 [2022-07-11 23:46:36,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:36,904 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 279 transitions. [2022-07-11 23:46:36,904 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-11 23:46:36,904 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 279 transitions. [2022-07-11 23:46:36,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-11 23:46:36,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:36,905 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, 1] [2022-07-11 23:46:36,905 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-11 23:46:36,906 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:36,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:36,906 INFO L85 PathProgramCache]: Analyzing trace with hash -788572498, now seen corresponding path program 1 times [2022-07-11 23:46:36,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:36,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269458572] [2022-07-11 23:46:36,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:36,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:36,941 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-11 23:46:36,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:36,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269458572] [2022-07-11 23:46:36,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269458572] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:36,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:36,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:36,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619912445] [2022-07-11 23:46:36,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:36,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:36,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:36,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:36,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:36,945 INFO L87 Difference]: Start difference. First operand 155 states and 279 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11 23:46:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:36,961 INFO L93 Difference]: Finished difference Result 234 states and 418 transitions. [2022-07-11 23:46:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:36,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-07-11 23:46:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:36,963 INFO L225 Difference]: With dead ends: 234 [2022-07-11 23:46:36,963 INFO L226 Difference]: Without dead ends: 159 [2022-07-11 23:46:36,963 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-11 23:46:36,964 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 59 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 188 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-11 23:46:36,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 188 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:36,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-11 23:46:36,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2022-07-11 23:46:36,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.7884615384615385) internal successors, (279), 156 states have internal predecessors, (279), 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-11 23:46:36,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 279 transitions. [2022-07-11 23:46:36,983 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 279 transitions. Word has length 21 [2022-07-11 23:46:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:36,983 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 279 transitions. [2022-07-11 23:46:36,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11 23:46:36,983 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 279 transitions. [2022-07-11 23:46:36,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-11 23:46:36,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:36,984 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, 1] [2022-07-11 23:46:36,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-11 23:46:36,984 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:36,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:36,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1809640852, now seen corresponding path program 1 times [2022-07-11 23:46:36,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:36,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288712090] [2022-07-11 23:46:36,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:36,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,017 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-11 23:46:37,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,019 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288712090] [2022-07-11 23:46:37,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288712090] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769792230] [2022-07-11 23:46:37,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,022 INFO L87 Difference]: Start difference. First operand 157 states and 279 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11 23:46:37,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,037 INFO L93 Difference]: Finished difference Result 453 states and 809 transitions. [2022-07-11 23:46:37,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:37,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-07-11 23:46:37,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,040 INFO L225 Difference]: With dead ends: 453 [2022-07-11 23:46:37,040 INFO L226 Difference]: Without dead ends: 303 [2022-07-11 23:46:37,041 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-11 23:46:37,043 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 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-11 23:46:37,043 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:37,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-07-11 23:46:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2022-07-11 23:46:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.77) internal successors, (531), 300 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-11 23:46:37,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 531 transitions. [2022-07-11 23:46:37,053 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 531 transitions. Word has length 21 [2022-07-11 23:46:37,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:37,053 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 531 transitions. [2022-07-11 23:46:37,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11 23:46:37,054 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 531 transitions. [2022-07-11 23:46:37,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-11 23:46:37,054 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:37,055 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, 1] [2022-07-11 23:46:37,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-11 23:46:37,055 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:37,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:37,056 INFO L85 PathProgramCache]: Analyzing trace with hash -529777174, now seen corresponding path program 1 times [2022-07-11 23:46:37,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:37,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175839291] [2022-07-11 23:46:37,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:37,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,075 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-11 23:46:37,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175839291] [2022-07-11 23:46:37,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175839291] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136502243] [2022-07-11 23:46:37,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,078 INFO L87 Difference]: Start difference. First operand 301 states and 531 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11 23:46:37,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,085 INFO L93 Difference]: Finished difference Result 385 states and 685 transitions. [2022-07-11 23:46:37,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:37,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-07-11 23:46:37,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,087 INFO L225 Difference]: With dead ends: 385 [2022-07-11 23:46:37,087 INFO L226 Difference]: Without dead ends: 383 [2022-07-11 23:46:37,088 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-11 23:46:37,088 INFO L413 NwaCegarLoop]: 137 mSDtfsCounter, 52 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 206 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-11 23:46:37,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 206 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:37,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2022-07-11 23:46:37,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 301. [2022-07-11 23:46:37,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 301 states, 300 states have (on average 1.7566666666666666) internal successors, (527), 300 states have internal predecessors, (527), 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-11 23:46:37,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 527 transitions. [2022-07-11 23:46:37,097 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 527 transitions. Word has length 21 [2022-07-11 23:46:37,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:37,098 INFO L495 AbstractCegarLoop]: Abstraction has 301 states and 527 transitions. [2022-07-11 23:46:37,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-11 23:46:37,098 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 527 transitions. [2022-07-11 23:46:37,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:46:37,099 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:37,099 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, 1, 1] [2022-07-11 23:46:37,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-11 23:46:37,099 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:37,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash -264078182, now seen corresponding path program 1 times [2022-07-11 23:46:37,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:37,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734443947] [2022-07-11 23:46:37,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,124 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-11 23:46:37,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,124 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734443947] [2022-07-11 23:46:37,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734443947] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991596082] [2022-07-11 23:46:37,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,126 INFO L87 Difference]: Start difference. First operand 301 states and 527 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-11 23:46:37,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,136 INFO L93 Difference]: Finished difference Result 565 states and 1001 transitions. [2022-07-11 23:46:37,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:37,136 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-07-11 23:46:37,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,138 INFO L225 Difference]: With dead ends: 565 [2022-07-11 23:46:37,138 INFO L226 Difference]: Without dead ends: 563 [2022-07-11 23:46:37,138 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-11 23:46:37,139 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 145 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-11 23:46:37,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 145 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:37,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2022-07-11 23:46:37,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 417. [2022-07-11 23:46:37,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 416 states have (on average 1.7283653846153846) internal successors, (719), 416 states have internal predecessors, (719), 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-11 23:46:37,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 719 transitions. [2022-07-11 23:46:37,150 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 719 transitions. Word has length 22 [2022-07-11 23:46:37,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:37,150 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 719 transitions. [2022-07-11 23:46:37,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-11 23:46:37,150 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 719 transitions. [2022-07-11 23:46:37,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-11 23:46:37,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:37,152 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, 1, 1] [2022-07-11 23:46:37,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-11 23:46:37,152 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:37,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:37,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1543941860, now seen corresponding path program 1 times [2022-07-11 23:46:37,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:37,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294744498] [2022-07-11 23:46:37,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:37,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,169 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-11 23:46:37,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294744498] [2022-07-11 23:46:37,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294744498] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564507242] [2022-07-11 23:46:37,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,171 INFO L87 Difference]: Start difference. First operand 417 states and 719 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-11 23:46:37,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,182 INFO L93 Difference]: Finished difference Result 997 states and 1729 transitions. [2022-07-11 23:46:37,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:37,183 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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 22 [2022-07-11 23:46:37,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,184 INFO L225 Difference]: With dead ends: 997 [2022-07-11 23:46:37,184 INFO L226 Difference]: Without dead ends: 587 [2022-07-11 23:46:37,185 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-11 23:46:37,185 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 55 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 174 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-11 23:46:37,186 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 174 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:37,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2022-07-11 23:46:37,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 585. [2022-07-11 23:46:37,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.7174657534246576) internal successors, (1003), 584 states have internal predecessors, (1003), 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-11 23:46:37,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 1003 transitions. [2022-07-11 23:46:37,196 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 1003 transitions. Word has length 22 [2022-07-11 23:46:37,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:37,196 INFO L495 AbstractCegarLoop]: Abstraction has 585 states and 1003 transitions. [2022-07-11 23:46:37,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 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-11 23:46:37,196 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 1003 transitions. [2022-07-11 23:46:37,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-11 23:46:37,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:37,197 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, 1, 1, 1] [2022-07-11 23:46:37,197 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-11 23:46:37,197 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:37,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:37,198 INFO L85 PathProgramCache]: Analyzing trace with hash 403724673, now seen corresponding path program 1 times [2022-07-11 23:46:37,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:37,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744587046] [2022-07-11 23:46:37,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:37,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:37,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,213 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-11 23:46:37,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744587046] [2022-07-11 23:46:37,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744587046] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097954712] [2022-07-11 23:46:37,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,214 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,215 INFO L87 Difference]: Start difference. First operand 585 states and 1003 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11 23:46:37,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,226 INFO L93 Difference]: Finished difference Result 885 states and 1513 transitions. [2022-07-11 23:46:37,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:37,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-07-11 23:46:37,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,228 INFO L225 Difference]: With dead ends: 885 [2022-07-11 23:46:37,228 INFO L226 Difference]: Without dead ends: 599 [2022-07-11 23:46:37,229 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-11 23:46:37,229 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 57 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 180 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-11 23:46:37,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 180 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:37,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-07-11 23:46:37,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2022-07-11 23:46:37,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.6963087248322148) internal successors, (1011), 596 states have internal predecessors, (1011), 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-11 23:46:37,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1011 transitions. [2022-07-11 23:46:37,250 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1011 transitions. Word has length 23 [2022-07-11 23:46:37,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:37,251 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 1011 transitions. [2022-07-11 23:46:37,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11 23:46:37,252 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1011 transitions. [2022-07-11 23:46:37,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-11 23:46:37,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:37,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, 1, 1, 1, 1] [2022-07-11 23:46:37,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-11 23:46:37,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:37,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:37,255 INFO L85 PathProgramCache]: Analyzing trace with hash -617343681, now seen corresponding path program 1 times [2022-07-11 23:46:37,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:37,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129389407] [2022-07-11 23:46:37,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:37,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,270 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-11 23:46:37,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129389407] [2022-07-11 23:46:37,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129389407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019601825] [2022-07-11 23:46:37,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,272 INFO L87 Difference]: Start difference. First operand 597 states and 1011 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11 23:46:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,285 INFO L93 Difference]: Finished difference Result 1097 states and 1885 transitions. [2022-07-11 23:46:37,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:37,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-07-11 23:46:37,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,289 INFO L225 Difference]: With dead ends: 1097 [2022-07-11 23:46:37,289 INFO L226 Difference]: Without dead ends: 1095 [2022-07-11 23:46:37,289 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-11 23:46:37,290 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 143 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-11 23:46:37,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 143 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:37,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1095 states. [2022-07-11 23:46:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1095 to 837. [2022-07-11 23:46:37,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 837 states, 836 states have (on average 1.6590909090909092) internal successors, (1387), 836 states have internal predecessors, (1387), 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-11 23:46:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1387 transitions. [2022-07-11 23:46:37,306 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1387 transitions. Word has length 23 [2022-07-11 23:46:37,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:37,306 INFO L495 AbstractCegarLoop]: Abstraction has 837 states and 1387 transitions. [2022-07-11 23:46:37,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11 23:46:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1387 transitions. [2022-07-11 23:46:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-11 23:46:37,308 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:37,309 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, 1, 1, 1] [2022-07-11 23:46:37,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-11 23:46:37,309 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:37,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:37,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1897207359, now seen corresponding path program 1 times [2022-07-11 23:46:37,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:37,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138583687] [2022-07-11 23:46:37,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:37,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:37,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,366 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-11 23:46:37,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138583687] [2022-07-11 23:46:37,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138583687] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,367 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,367 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309645178] [2022-07-11 23:46:37,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,368 INFO L87 Difference]: Start difference. First operand 837 states and 1387 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11 23:46:37,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,386 INFO L93 Difference]: Finished difference Result 1977 states and 3293 transitions. [2022-07-11 23:46:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:37,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 23 [2022-07-11 23:46:37,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,390 INFO L225 Difference]: With dead ends: 1977 [2022-07-11 23:46:37,390 INFO L226 Difference]: Without dead ends: 1159 [2022-07-11 23:46:37,391 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-11 23:46:37,392 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 54 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 175 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-11 23:46:37,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:37,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-07-11 23:46:37,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 1157. [2022-07-11 23:46:37,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.6496539792387543) internal successors, (1907), 1156 states have internal predecessors, (1907), 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-11 23:46:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1907 transitions. [2022-07-11 23:46:37,415 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1907 transitions. Word has length 23 [2022-07-11 23:46:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:37,415 INFO L495 AbstractCegarLoop]: Abstraction has 1157 states and 1907 transitions. [2022-07-11 23:46:37,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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-11 23:46:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1907 transitions. [2022-07-11 23:46:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:46:37,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:37,416 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, 1, 1, 1, 1] [2022-07-11 23:46:37,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-11 23:46:37,417 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:37,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:37,417 INFO L85 PathProgramCache]: Analyzing trace with hash -1957570863, now seen corresponding path program 1 times [2022-07-11 23:46:37,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:37,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14730918] [2022-07-11 23:46:37,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:37,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,445 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-11 23:46:37,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14730918] [2022-07-11 23:46:37,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14730918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067828095] [2022-07-11 23:46:37,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,446 INFO L87 Difference]: Start difference. First operand 1157 states and 1907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11 23:46:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,466 INFO L93 Difference]: Finished difference Result 1737 states and 2853 transitions. [2022-07-11 23:46:37,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:37,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-07-11 23:46:37,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,470 INFO L225 Difference]: With dead ends: 1737 [2022-07-11 23:46:37,470 INFO L226 Difference]: Without dead ends: 1175 [2022-07-11 23:46:37,471 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-11 23:46:37,472 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 56 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 176 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-11 23:46:37,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:37,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2022-07-11 23:46:37,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 1173. [2022-07-11 23:46:37,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.6271331058020477) internal successors, (1907), 1172 states have internal predecessors, (1907), 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-11 23:46:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1907 transitions. [2022-07-11 23:46:37,506 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1907 transitions. Word has length 24 [2022-07-11 23:46:37,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:37,508 INFO L495 AbstractCegarLoop]: Abstraction has 1173 states and 1907 transitions. [2022-07-11 23:46:37,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11 23:46:37,508 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1907 transitions. [2022-07-11 23:46:37,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:46:37,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:37,509 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, 1, 1, 1, 1] [2022-07-11 23:46:37,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-11 23:46:37,510 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:37,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:37,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1316328079, now seen corresponding path program 1 times [2022-07-11 23:46:37,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:37,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177326367] [2022-07-11 23:46:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:37,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:37,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,533 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-11 23:46:37,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177326367] [2022-07-11 23:46:37,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177326367] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074060294] [2022-07-11 23:46:37,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,535 INFO L87 Difference]: Start difference. First operand 1173 states and 1907 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11 23:46:37,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,559 INFO L93 Difference]: Finished difference Result 2121 states and 3509 transitions. [2022-07-11 23:46:37,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:37,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-07-11 23:46:37,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,565 INFO L225 Difference]: With dead ends: 2121 [2022-07-11 23:46:37,565 INFO L226 Difference]: Without dead ends: 2119 [2022-07-11 23:46:37,567 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-11 23:46:37,568 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 43 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 141 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-11 23:46:37,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 141 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:37,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-07-11 23:46:37,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 1669. [2022-07-11 23:46:37,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1669 states, 1668 states have (on average 1.5845323741007193) internal successors, (2643), 1668 states have internal predecessors, (2643), 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-11 23:46:37,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1669 states to 1669 states and 2643 transitions. [2022-07-11 23:46:37,604 INFO L78 Accepts]: Start accepts. Automaton has 1669 states and 2643 transitions. Word has length 24 [2022-07-11 23:46:37,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:37,604 INFO L495 AbstractCegarLoop]: Abstraction has 1669 states and 2643 transitions. [2022-07-11 23:46:37,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11 23:46:37,604 INFO L276 IsEmpty]: Start isEmpty. Operand 1669 states and 2643 transitions. [2022-07-11 23:46:37,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:46:37,606 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:37,606 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, 1, 1, 1, 1] [2022-07-11 23:46:37,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-11 23:46:37,607 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:37,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:37,607 INFO L85 PathProgramCache]: Analyzing trace with hash 36464401, now seen corresponding path program 1 times [2022-07-11 23:46:37,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:37,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787568755] [2022-07-11 23:46:37,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:37,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,634 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-11 23:46:37,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787568755] [2022-07-11 23:46:37,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787568755] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826431344] [2022-07-11 23:46:37,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,639 INFO L87 Difference]: Start difference. First operand 1669 states and 2643 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11 23:46:37,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,666 INFO L93 Difference]: Finished difference Result 3913 states and 6229 transitions. [2022-07-11 23:46:37,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:37,667 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 24 [2022-07-11 23:46:37,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,673 INFO L225 Difference]: With dead ends: 3913 [2022-07-11 23:46:37,673 INFO L226 Difference]: Without dead ends: 2279 [2022-07-11 23:46:37,675 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-11 23:46:37,675 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 176 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-11 23:46:37,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 176 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:37,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2279 states. [2022-07-11 23:46:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2279 to 2277. [2022-07-11 23:46:37,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2277 states, 2276 states have (on average 1.5760105448154658) internal successors, (3587), 2276 states have internal predecessors, (3587), 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-11 23:46:37,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2277 states to 2277 states and 3587 transitions. [2022-07-11 23:46:37,730 INFO L78 Accepts]: Start accepts. Automaton has 2277 states and 3587 transitions. Word has length 24 [2022-07-11 23:46:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:37,730 INFO L495 AbstractCegarLoop]: Abstraction has 2277 states and 3587 transitions. [2022-07-11 23:46:37,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-11 23:46:37,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2277 states and 3587 transitions. [2022-07-11 23:46:37,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-11 23:46:37,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:37,732 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, 1, 1, 1, 1, 1] [2022-07-11 23:46:37,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-11 23:46:37,733 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:37,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:37,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2143288106, now seen corresponding path program 1 times [2022-07-11 23:46:37,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:37,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436648044] [2022-07-11 23:46:37,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:37,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,771 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-11 23:46:37,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436648044] [2022-07-11 23:46:37,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436648044] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395131276] [2022-07-11 23:46:37,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,772 INFO L87 Difference]: Start difference. First operand 2277 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11 23:46:37,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,805 INFO L93 Difference]: Finished difference Result 3417 states and 5365 transitions. [2022-07-11 23:46:37,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:37,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-07-11 23:46:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,812 INFO L225 Difference]: With dead ends: 3417 [2022-07-11 23:46:37,812 INFO L226 Difference]: Without dead ends: 2311 [2022-07-11 23:46:37,814 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-11 23:46:37,815 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 55 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 172 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-11 23:46:37,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:37,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2311 states. [2022-07-11 23:46:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2311 to 2309. [2022-07-11 23:46:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2309 states, 2308 states have (on average 1.5541594454072791) internal successors, (3587), 2308 states have internal predecessors, (3587), 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-11 23:46:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2309 states to 2309 states and 3587 transitions. [2022-07-11 23:46:37,868 INFO L78 Accepts]: Start accepts. Automaton has 2309 states and 3587 transitions. Word has length 25 [2022-07-11 23:46:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:37,868 INFO L495 AbstractCegarLoop]: Abstraction has 2309 states and 3587 transitions. [2022-07-11 23:46:37,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11 23:46:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2309 states and 3587 transitions. [2022-07-11 23:46:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-11 23:46:37,870 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:37,870 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, 1, 1, 1, 1, 1] [2022-07-11 23:46:37,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-11 23:46:37,871 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:37,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:37,871 INFO L85 PathProgramCache]: Analyzing trace with hash 1130610836, now seen corresponding path program 1 times [2022-07-11 23:46:37,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:37,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047255156] [2022-07-11 23:46:37,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:37,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:37,894 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-11 23:46:37,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:37,895 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047255156] [2022-07-11 23:46:37,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047255156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:37,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:37,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:37,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805972370] [2022-07-11 23:46:37,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:37,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:37,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:37,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:37,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:37,897 INFO L87 Difference]: Start difference. First operand 2309 states and 3587 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11 23:46:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:37,936 INFO L93 Difference]: Finished difference Result 4105 states and 6501 transitions. [2022-07-11 23:46:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:37,936 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-07-11 23:46:37,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:37,949 INFO L225 Difference]: With dead ends: 4105 [2022-07-11 23:46:37,949 INFO L226 Difference]: Without dead ends: 4103 [2022-07-11 23:46:37,951 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-11 23:46:37,951 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 40 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 139 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-11 23:46:37,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:37,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2022-07-11 23:46:38,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 3333. [2022-07-11 23:46:38,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.508703481392557) internal successors, (5027), 3332 states have internal predecessors, (5027), 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-11 23:46:38,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 5027 transitions. [2022-07-11 23:46:38,027 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 5027 transitions. Word has length 25 [2022-07-11 23:46:38,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:38,027 INFO L495 AbstractCegarLoop]: Abstraction has 3333 states and 5027 transitions. [2022-07-11 23:46:38,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11 23:46:38,027 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 5027 transitions. [2022-07-11 23:46:38,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-11 23:46:38,030 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:38,030 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, 1, 1, 1, 1, 1] [2022-07-11 23:46:38,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-11 23:46:38,030 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:38,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:38,030 INFO L85 PathProgramCache]: Analyzing trace with hash -149252842, now seen corresponding path program 1 times [2022-07-11 23:46:38,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:38,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825953611] [2022-07-11 23:46:38,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:38,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:38,054 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-11 23:46:38,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:38,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825953611] [2022-07-11 23:46:38,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825953611] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:38,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:38,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:38,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864834369] [2022-07-11 23:46:38,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:38,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:38,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:38,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:38,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:38,056 INFO L87 Difference]: Start difference. First operand 3333 states and 5027 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11 23:46:38,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:38,130 INFO L93 Difference]: Finished difference Result 7753 states and 11749 transitions. [2022-07-11 23:46:38,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:38,131 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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 25 [2022-07-11 23:46:38,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:38,140 INFO L225 Difference]: With dead ends: 7753 [2022-07-11 23:46:38,141 INFO L226 Difference]: Without dead ends: 4487 [2022-07-11 23:46:38,143 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-11 23:46:38,144 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 52 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 177 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-11 23:46:38,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 177 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:38,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4487 states. [2022-07-11 23:46:38,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4487 to 4485. [2022-07-11 23:46:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4485 states, 4484 states have (on average 1.4993309545049063) internal successors, (6723), 4484 states have internal predecessors, (6723), 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-11 23:46:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4485 states to 4485 states and 6723 transitions. [2022-07-11 23:46:38,226 INFO L78 Accepts]: Start accepts. Automaton has 4485 states and 6723 transitions. Word has length 25 [2022-07-11 23:46:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:38,226 INFO L495 AbstractCegarLoop]: Abstraction has 4485 states and 6723 transitions. [2022-07-11 23:46:38,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 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-11 23:46:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 4485 states and 6723 transitions. [2022-07-11 23:46:38,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-11 23:46:38,229 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:38,229 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, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:38,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-11 23:46:38,230 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:38,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:38,230 INFO L85 PathProgramCache]: Analyzing trace with hash 689412294, now seen corresponding path program 1 times [2022-07-11 23:46:38,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:38,230 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599724798] [2022-07-11 23:46:38,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:38,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:38,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:38,241 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-11 23:46:38,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:38,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599724798] [2022-07-11 23:46:38,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599724798] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:38,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:38,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:38,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545216573] [2022-07-11 23:46:38,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:38,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:38,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:38,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:38,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:38,243 INFO L87 Difference]: Start difference. First operand 4485 states and 6723 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11 23:46:38,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:38,292 INFO L93 Difference]: Finished difference Result 6729 states and 10053 transitions. [2022-07-11 23:46:38,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:38,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2022-07-11 23:46:38,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:38,303 INFO L225 Difference]: With dead ends: 6729 [2022-07-11 23:46:38,303 INFO L226 Difference]: Without dead ends: 4551 [2022-07-11 23:46:38,306 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-11 23:46:38,306 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 54 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 168 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-11 23:46:38,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 168 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:38,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4551 states. [2022-07-11 23:46:38,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4551 to 4549. [2022-07-11 23:46:38,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4549 states, 4548 states have (on average 1.4782321899736148) internal successors, (6723), 4548 states have internal predecessors, (6723), 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-11 23:46:38,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 6723 transitions. [2022-07-11 23:46:38,412 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 6723 transitions. Word has length 26 [2022-07-11 23:46:38,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:38,412 INFO L495 AbstractCegarLoop]: Abstraction has 4549 states and 6723 transitions. [2022-07-11 23:46:38,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11 23:46:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 6723 transitions. [2022-07-11 23:46:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-11 23:46:38,415 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:38,415 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, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:38,416 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-11 23:46:38,416 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:38,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:38,416 INFO L85 PathProgramCache]: Analyzing trace with hash -331656060, now seen corresponding path program 1 times [2022-07-11 23:46:38,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:38,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399860846] [2022-07-11 23:46:38,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:38,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:38,427 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-11 23:46:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:38,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399860846] [2022-07-11 23:46:38,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399860846] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:38,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:38,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:38,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556986423] [2022-07-11 23:46:38,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:38,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:38,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:38,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:38,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:38,429 INFO L87 Difference]: Start difference. First operand 4549 states and 6723 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11 23:46:38,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:38,499 INFO L93 Difference]: Finished difference Result 7945 states and 11973 transitions. [2022-07-11 23:46:38,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:38,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2022-07-11 23:46:38,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:38,511 INFO L225 Difference]: With dead ends: 7945 [2022-07-11 23:46:38,512 INFO L226 Difference]: Without dead ends: 7943 [2022-07-11 23:46:38,514 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-11 23:46:38,515 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 37 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 137 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-11 23:46:38,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:38,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7943 states. [2022-07-11 23:46:38,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7943 to 6661. [2022-07-11 23:46:38,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.4322822822822823) internal successors, (9539), 6660 states have internal predecessors, (9539), 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-11 23:46:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 9539 transitions. [2022-07-11 23:46:38,691 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 9539 transitions. Word has length 26 [2022-07-11 23:46:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:38,691 INFO L495 AbstractCegarLoop]: Abstraction has 6661 states and 9539 transitions. [2022-07-11 23:46:38,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11 23:46:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 9539 transitions. [2022-07-11 23:46:38,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-11 23:46:38,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:38,699 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, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:38,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-11 23:46:38,700 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:38,700 INFO L85 PathProgramCache]: Analyzing trace with hash -1611519738, now seen corresponding path program 1 times [2022-07-11 23:46:38,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:38,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122489065] [2022-07-11 23:46:38,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:38,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:38,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:38,720 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-11 23:46:38,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:38,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122489065] [2022-07-11 23:46:38,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122489065] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:38,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:38,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:38,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736085560] [2022-07-11 23:46:38,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:38,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:38,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:38,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:38,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:38,723 INFO L87 Difference]: Start difference. First operand 6661 states and 9539 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11 23:46:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:38,805 INFO L93 Difference]: Finished difference Result 15369 states and 22085 transitions. [2022-07-11 23:46:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:38,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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 26 [2022-07-11 23:46:38,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:38,817 INFO L225 Difference]: With dead ends: 15369 [2022-07-11 23:46:38,817 INFO L226 Difference]: Without dead ends: 8839 [2022-07-11 23:46:38,824 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-11 23:46:38,825 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 178 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-11 23:46:38,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 178 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8839 states. [2022-07-11 23:46:39,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8839 to 8837. [2022-07-11 23:46:39,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8837 states, 8836 states have (on average 1.4199864191942055) internal successors, (12547), 8836 states have internal predecessors, (12547), 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-11 23:46:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 12547 transitions. [2022-07-11 23:46:39,037 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 12547 transitions. Word has length 26 [2022-07-11 23:46:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:39,037 INFO L495 AbstractCegarLoop]: Abstraction has 8837 states and 12547 transitions. [2022-07-11 23:46:39,038 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-11 23:46:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 12547 transitions. [2022-07-11 23:46:39,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:46:39,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:39,045 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:39,045 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-11 23:46:39,045 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:39,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:39,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1691188181, now seen corresponding path program 1 times [2022-07-11 23:46:39,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:39,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187403631] [2022-07-11 23:46:39,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:39,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:39,064 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-11 23:46:39,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:39,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187403631] [2022-07-11 23:46:39,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187403631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:39,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:39,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:39,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978457564] [2022-07-11 23:46:39,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:39,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:39,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:39,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:39,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:39,067 INFO L87 Difference]: Start difference. First operand 8837 states and 12547 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-11 23:46:39,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:39,172 INFO L93 Difference]: Finished difference Result 13257 states and 18757 transitions. [2022-07-11 23:46:39,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:39,173 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2022-07-11 23:46:39,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:39,184 INFO L225 Difference]: With dead ends: 13257 [2022-07-11 23:46:39,185 INFO L226 Difference]: Without dead ends: 8967 [2022-07-11 23:46:39,189 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-11 23:46:39,190 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 53 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 164 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-11 23:46:39,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:39,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8967 states. [2022-07-11 23:46:39,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8967 to 8965. [2022-07-11 23:46:39,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8965 states, 8964 states have (on average 1.3997099509147701) internal successors, (12547), 8964 states have internal predecessors, (12547), 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-11 23:46:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8965 states to 8965 states and 12547 transitions. [2022-07-11 23:46:39,395 INFO L78 Accepts]: Start accepts. Automaton has 8965 states and 12547 transitions. Word has length 27 [2022-07-11 23:46:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:39,395 INFO L495 AbstractCegarLoop]: Abstraction has 8965 states and 12547 transitions. [2022-07-11 23:46:39,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-11 23:46:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 8965 states and 12547 transitions. [2022-07-11 23:46:39,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:46:39,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:39,401 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:39,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-11 23:46:39,401 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:39,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:39,401 INFO L85 PathProgramCache]: Analyzing trace with hash 1582710761, now seen corresponding path program 1 times [2022-07-11 23:46:39,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:39,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280587858] [2022-07-11 23:46:39,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:39,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:39,415 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-11 23:46:39,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:39,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280587858] [2022-07-11 23:46:39,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280587858] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:39,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:39,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:39,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843882507] [2022-07-11 23:46:39,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:39,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:39,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:39,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:39,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:39,417 INFO L87 Difference]: Start difference. First operand 8965 states and 12547 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-11 23:46:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:39,504 INFO L93 Difference]: Finished difference Result 15369 states and 21893 transitions. [2022-07-11 23:46:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:39,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2022-07-11 23:46:39,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:39,526 INFO L225 Difference]: With dead ends: 15369 [2022-07-11 23:46:39,526 INFO L226 Difference]: Without dead ends: 15367 [2022-07-11 23:46:39,531 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-11 23:46:39,531 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 34 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 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-11 23:46:39,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:39,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15367 states. [2022-07-11 23:46:39,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15367 to 13317. [2022-07-11 23:46:39,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13317 states, 13316 states have (on average 1.3555872634424753) internal successors, (18051), 13316 states have internal predecessors, (18051), 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-11 23:46:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13317 states to 13317 states and 18051 transitions. [2022-07-11 23:46:39,786 INFO L78 Accepts]: Start accepts. Automaton has 13317 states and 18051 transitions. Word has length 27 [2022-07-11 23:46:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:39,786 INFO L495 AbstractCegarLoop]: Abstraction has 13317 states and 18051 transitions. [2022-07-11 23:46:39,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-11 23:46:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 13317 states and 18051 transitions. [2022-07-11 23:46:39,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-11 23:46:39,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:39,798 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, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:39,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-11 23:46:39,798 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:39,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:39,799 INFO L85 PathProgramCache]: Analyzing trace with hash 302847083, now seen corresponding path program 1 times [2022-07-11 23:46:39,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:39,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518256447] [2022-07-11 23:46:39,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:39,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:39,813 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-11 23:46:39,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:39,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518256447] [2022-07-11 23:46:39,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518256447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:39,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:39,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129983266] [2022-07-11 23:46:39,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:39,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:39,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:39,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:39,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:39,820 INFO L87 Difference]: Start difference. First operand 13317 states and 18051 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-11 23:46:39,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:39,992 INFO L93 Difference]: Finished difference Result 30473 states and 41349 transitions. [2022-07-11 23:46:39,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:39,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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 27 [2022-07-11 23:46:39,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:40,014 INFO L225 Difference]: With dead ends: 30473 [2022-07-11 23:46:40,015 INFO L226 Difference]: Without dead ends: 17415 [2022-07-11 23:46:40,027 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-11 23:46:40,027 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 50 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 179 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-11 23:46:40,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 179 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17415 states. [2022-07-11 23:46:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17415 to 17413. [2022-07-11 23:46:40,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17413 states, 17412 states have (on average 1.3381001608086378) internal successors, (23299), 17412 states have internal predecessors, (23299), 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-11 23:46:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17413 states to 17413 states and 23299 transitions. [2022-07-11 23:46:40,337 INFO L78 Accepts]: Start accepts. Automaton has 17413 states and 23299 transitions. Word has length 27 [2022-07-11 23:46:40,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:40,338 INFO L495 AbstractCegarLoop]: Abstraction has 17413 states and 23299 transitions. [2022-07-11 23:46:40,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 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-11 23:46:40,338 INFO L276 IsEmpty]: Start isEmpty. Operand 17413 states and 23299 transitions. [2022-07-11 23:46:40,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:46:40,349 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:40,349 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:40,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-11 23:46:40,350 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:40,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:40,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1819608763, now seen corresponding path program 1 times [2022-07-11 23:46:40,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:40,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095937631] [2022-07-11 23:46:40,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:40,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:40,363 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-11 23:46:40,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:40,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095937631] [2022-07-11 23:46:40,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095937631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:40,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:40,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:40,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681747239] [2022-07-11 23:46:40,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:40,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:40,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:40,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:40,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:40,365 INFO L87 Difference]: Start difference. First operand 17413 states and 23299 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11 23:46:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:40,470 INFO L93 Difference]: Finished difference Result 26121 states and 34821 transitions. [2022-07-11 23:46:40,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:40,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-07-11 23:46:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:40,493 INFO L225 Difference]: With dead ends: 26121 [2022-07-11 23:46:40,493 INFO L226 Difference]: Without dead ends: 17671 [2022-07-11 23:46:40,505 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-11 23:46:40,505 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 52 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 160 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-11 23:46:40,506 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:40,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17671 states. [2022-07-11 23:46:40,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17671 to 17669. [2022-07-11 23:46:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17669 states, 17668 states have (on average 1.318711795336201) internal successors, (23299), 17668 states have internal predecessors, (23299), 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-11 23:46:40,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17669 states to 17669 states and 23299 transitions. [2022-07-11 23:46:40,798 INFO L78 Accepts]: Start accepts. Automaton has 17669 states and 23299 transitions. Word has length 28 [2022-07-11 23:46:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:40,798 INFO L495 AbstractCegarLoop]: Abstraction has 17669 states and 23299 transitions. [2022-07-11 23:46:40,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11 23:46:40,798 INFO L276 IsEmpty]: Start isEmpty. Operand 17669 states and 23299 transitions. [2022-07-11 23:46:40,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:46:40,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:40,810 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:40,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-11 23:46:40,810 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:40,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:40,811 INFO L85 PathProgramCache]: Analyzing trace with hash 798540409, now seen corresponding path program 1 times [2022-07-11 23:46:40,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:40,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492226396] [2022-07-11 23:46:40,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:40,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:40,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:40,830 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-11 23:46:40,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:40,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492226396] [2022-07-11 23:46:40,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492226396] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:40,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:40,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:40,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637653741] [2022-07-11 23:46:40,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:40,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:40,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:40,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:40,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:40,832 INFO L87 Difference]: Start difference. First operand 17669 states and 23299 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11 23:46:41,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:41,071 INFO L93 Difference]: Finished difference Result 29705 states and 39685 transitions. [2022-07-11 23:46:41,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:41,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-07-11 23:46:41,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:41,114 INFO L225 Difference]: With dead ends: 29705 [2022-07-11 23:46:41,114 INFO L226 Difference]: Without dead ends: 29703 [2022-07-11 23:46:41,122 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-11 23:46:41,122 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 31 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 133 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-11 23:46:41,123 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:41,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29703 states. [2022-07-11 23:46:41,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29703 to 26629. [2022-07-11 23:46:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26629 states, 26628 states have (on average 1.2787667117320114) internal successors, (34051), 26628 states have internal predecessors, (34051), 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-11 23:46:41,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26629 states to 26629 states and 34051 transitions. [2022-07-11 23:46:41,562 INFO L78 Accepts]: Start accepts. Automaton has 26629 states and 34051 transitions. Word has length 28 [2022-07-11 23:46:41,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:41,562 INFO L495 AbstractCegarLoop]: Abstraction has 26629 states and 34051 transitions. [2022-07-11 23:46:41,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11 23:46:41,562 INFO L276 IsEmpty]: Start isEmpty. Operand 26629 states and 34051 transitions. [2022-07-11 23:46:41,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-11 23:46:41,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:41,583 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:41,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-11 23:46:41,584 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:41,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:41,584 INFO L85 PathProgramCache]: Analyzing trace with hash -481323269, now seen corresponding path program 1 times [2022-07-11 23:46:41,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:41,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146609665] [2022-07-11 23:46:41,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:41,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:41,595 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-11 23:46:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:41,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146609665] [2022-07-11 23:46:41,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146609665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:41,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:41,596 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:41,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911263016] [2022-07-11 23:46:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:41,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:41,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:41,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:41,598 INFO L87 Difference]: Start difference. First operand 26629 states and 34051 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11 23:46:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:41,848 INFO L93 Difference]: Finished difference Result 60425 states and 77061 transitions. [2022-07-11 23:46:41,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:41,849 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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 28 [2022-07-11 23:46:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:41,905 INFO L225 Difference]: With dead ends: 60425 [2022-07-11 23:46:41,905 INFO L226 Difference]: Without dead ends: 34311 [2022-07-11 23:46:41,936 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-11 23:46:41,936 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 180 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-11 23:46:41,937 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:41,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34311 states. [2022-07-11 23:46:42,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34311 to 34309. [2022-07-11 23:46:42,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34309 states, 34308 states have (on average 1.2536726128016789) internal successors, (43011), 34308 states have internal predecessors, (43011), 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-11 23:46:42,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34309 states to 34309 states and 43011 transitions. [2022-07-11 23:46:42,666 INFO L78 Accepts]: Start accepts. Automaton has 34309 states and 43011 transitions. Word has length 28 [2022-07-11 23:46:42,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:42,666 INFO L495 AbstractCegarLoop]: Abstraction has 34309 states and 43011 transitions. [2022-07-11 23:46:42,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 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-11 23:46:42,666 INFO L276 IsEmpty]: Start isEmpty. Operand 34309 states and 43011 transitions. [2022-07-11 23:46:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:46:42,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:42,684 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:42,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-11 23:46:42,684 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:42,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:42,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1014835328, now seen corresponding path program 1 times [2022-07-11 23:46:42,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:42,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094141022] [2022-07-11 23:46:42,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:42,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:42,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:42,694 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-11 23:46:42,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:42,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094141022] [2022-07-11 23:46:42,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094141022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:42,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:42,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:42,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294432592] [2022-07-11 23:46:42,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:42,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:42,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:42,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:42,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:42,695 INFO L87 Difference]: Start difference. First operand 34309 states and 43011 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11 23:46:42,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:42,912 INFO L93 Difference]: Finished difference Result 51465 states and 64261 transitions. [2022-07-11 23:46:42,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:42,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2022-07-11 23:46:42,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:42,963 INFO L225 Difference]: With dead ends: 51465 [2022-07-11 23:46:42,964 INFO L226 Difference]: Without dead ends: 34823 [2022-07-11 23:46:42,982 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-11 23:46:42,985 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 51 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 156 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-11 23:46:42,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34823 states. [2022-07-11 23:46:43,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34823 to 34821. [2022-07-11 23:46:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34821 states, 34820 states have (on average 1.23523836875359) internal successors, (43011), 34820 states have internal predecessors, (43011), 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-11 23:46:43,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34821 states to 34821 states and 43011 transitions. [2022-07-11 23:46:43,579 INFO L78 Accepts]: Start accepts. Automaton has 34821 states and 43011 transitions. Word has length 29 [2022-07-11 23:46:43,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:43,579 INFO L495 AbstractCegarLoop]: Abstraction has 34821 states and 43011 transitions. [2022-07-11 23:46:43,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11 23:46:43,580 INFO L276 IsEmpty]: Start isEmpty. Operand 34821 states and 43011 transitions. [2022-07-11 23:46:43,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:46:43,594 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:43,594 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:43,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-11 23:46:43,595 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:43,595 INFO L85 PathProgramCache]: Analyzing trace with hash -2035903682, now seen corresponding path program 1 times [2022-07-11 23:46:43,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:43,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326426154] [2022-07-11 23:46:43,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:43,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:43,607 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-11 23:46:43,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:43,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326426154] [2022-07-11 23:46:43,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326426154] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:43,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:43,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:43,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964142227] [2022-07-11 23:46:43,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:43,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:43,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:43,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:43,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:43,609 INFO L87 Difference]: Start difference. First operand 34821 states and 43011 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11 23:46:44,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:44,107 INFO L93 Difference]: Finished difference Result 101385 states and 122885 transitions. [2022-07-11 23:46:44,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:44,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2022-07-11 23:46:44,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:44,201 INFO L225 Difference]: With dead ends: 101385 [2022-07-11 23:46:44,202 INFO L226 Difference]: Without dead ends: 67591 [2022-07-11 23:46:44,226 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-11 23:46:44,227 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 49 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 151 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-11 23:46:44,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 151 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:44,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67591 states. [2022-07-11 23:46:45,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67591 to 67589. [2022-07-11 23:46:45,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67589 states, 67588 states have (on average 1.1817926259099247) internal successors, (79875), 67588 states have internal predecessors, (79875), 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-11 23:46:45,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 79875 transitions. [2022-07-11 23:46:45,266 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 79875 transitions. Word has length 29 [2022-07-11 23:46:45,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:45,266 INFO L495 AbstractCegarLoop]: Abstraction has 67589 states and 79875 transitions. [2022-07-11 23:46:45,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11 23:46:45,267 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 79875 transitions. [2022-07-11 23:46:45,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-11 23:46:45,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:45,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:45,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-11 23:46:45,298 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:45,299 INFO L85 PathProgramCache]: Analyzing trace with hash -756040004, now seen corresponding path program 1 times [2022-07-11 23:46:45,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:45,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982067542] [2022-07-11 23:46:45,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:45,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:45,314 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-11 23:46:45,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:45,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982067542] [2022-07-11 23:46:45,315 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982067542] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:45,315 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:45,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:45,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672991603] [2022-07-11 23:46:45,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:45,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:45,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:45,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:45,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:45,316 INFO L87 Difference]: Start difference. First operand 67589 states and 79875 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11 23:46:45,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:45,963 INFO L93 Difference]: Finished difference Result 71689 states and 86021 transitions. [2022-07-11 23:46:45,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:45,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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 29 [2022-07-11 23:46:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:46,056 INFO L225 Difference]: With dead ends: 71689 [2022-07-11 23:46:46,057 INFO L226 Difference]: Without dead ends: 71687 [2022-07-11 23:46:46,071 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-11 23:46:46,072 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 28 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 166 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-11 23:46:46,072 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 166 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71687 states. [2022-07-11 23:46:46,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71687 to 67589. [2022-07-11 23:46:47,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67589 states, 67588 states have (on average 1.166642007456945) internal successors, (78851), 67588 states have internal predecessors, (78851), 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-11 23:46:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67589 states to 67589 states and 78851 transitions. [2022-07-11 23:46:47,102 INFO L78 Accepts]: Start accepts. Automaton has 67589 states and 78851 transitions. Word has length 29 [2022-07-11 23:46:47,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:47,102 INFO L495 AbstractCegarLoop]: Abstraction has 67589 states and 78851 transitions. [2022-07-11 23:46:47,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 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-11 23:46:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 67589 states and 78851 transitions. [2022-07-11 23:46:47,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-11 23:46:47,131 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:47,131 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:47,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-11 23:46:47,131 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:47,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:47,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1311711408, now seen corresponding path program 1 times [2022-07-11 23:46:47,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:47,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996205191] [2022-07-11 23:46:47,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:47,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:47,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:47,148 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-11 23:46:47,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:47,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996205191] [2022-07-11 23:46:47,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996205191] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:47,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:47,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:47,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077760000] [2022-07-11 23:46:47,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:47,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:47,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:47,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:47,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:47,151 INFO L87 Difference]: Start difference. First operand 67589 states and 78851 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-11 23:46:47,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:47,895 INFO L93 Difference]: Finished difference Result 109575 states and 126980 transitions. [2022-07-11 23:46:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:47,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2022-07-11 23:46:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:48,146 INFO L225 Difference]: With dead ends: 109575 [2022-07-11 23:46:48,146 INFO L226 Difference]: Without dead ends: 109573 [2022-07-11 23:46:48,195 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-11 23:46:48,196 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 24 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 128 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-11 23:46:48,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:48,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109573 states. [2022-07-11 23:46:49,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109573 to 105477. [2022-07-11 23:46:49,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105477 states, 105476 states have (on average 1.1456160643179492) internal successors, (120835), 105476 states have internal predecessors, (120835), 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-11 23:46:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105477 states to 105477 states and 120835 transitions. [2022-07-11 23:46:49,807 INFO L78 Accepts]: Start accepts. Automaton has 105477 states and 120835 transitions. Word has length 30 [2022-07-11 23:46:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:49,807 INFO L495 AbstractCegarLoop]: Abstraction has 105477 states and 120835 transitions. [2022-07-11 23:46:49,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-11 23:46:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 105477 states and 120835 transitions. [2022-07-11 23:46:49,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-11 23:46:49,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:46:49,859 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:49,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-11 23:46:49,859 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:46:49,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:46:49,859 INFO L85 PathProgramCache]: Analyzing trace with hash 31847730, now seen corresponding path program 1 times [2022-07-11 23:46:49,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:46:49,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321247743] [2022-07-11 23:46:49,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:46:49,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:46:49,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:46:49,871 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-11 23:46:49,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:46:49,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321247743] [2022-07-11 23:46:49,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321247743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:46:49,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:46:49,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-11 23:46:49,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366764910] [2022-07-11 23:46:49,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:46:49,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-11 23:46:49,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:46:49,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-11 23:46:49,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-11 23:46:49,872 INFO L87 Difference]: Start difference. First operand 105477 states and 120835 transitions. Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-11 23:46:51,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:46:51,050 INFO L93 Difference]: Finished difference Result 236549 states and 268291 transitions. [2022-07-11 23:46:51,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-11 23:46:51,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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 30 [2022-07-11 23:46:51,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:46:51,051 INFO L225 Difference]: With dead ends: 236549 [2022-07-11 23:46:51,051 INFO L226 Difference]: Without dead ends: 0 [2022-07-11 23:46:51,137 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-11 23:46:51,138 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 46 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 180 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-11 23:46:51,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 180 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:46:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-11 23:46:51,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-11 23:46:51,138 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-11 23:46:51,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-11 23:46:51,139 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 30 [2022-07-11 23:46:51,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:46:51,139 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-11 23:46:51,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 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-11 23:46:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-11 23:46:51,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-11 23:46:51,142 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-11 23:46:51,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-11 23:46:51,143 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-11 23:46:51,161 INFO L899 garLoopResultBuilder]: For program point L184(line 184) no Hoare annotation was computed. [2022-07-11 23:46:51,161 INFO L895 garLoopResultBuilder]: At program point L184-1(lines 7 193) the Hoare annotation is: false [2022-07-11 23:46:51,161 INFO L899 garLoopResultBuilder]: For program point L118-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,161 INFO L899 garLoopResultBuilder]: For program point L168-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,161 INFO L899 garLoopResultBuilder]: For program point L102-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,162 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-11 23:46:51,162 INFO L899 garLoopResultBuilder]: For program point L86-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,162 INFO L899 garLoopResultBuilder]: For program point L169(line 169) no Hoare annotation was computed. [2022-07-11 23:46:51,162 INFO L899 garLoopResultBuilder]: For program point L153-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,162 INFO L899 garLoopResultBuilder]: For program point L154(line 154) no Hoare annotation was computed. [2022-07-11 23:46:51,162 INFO L899 garLoopResultBuilder]: For program point L138-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,162 INFO L899 garLoopResultBuilder]: For program point L122-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,162 INFO L899 garLoopResultBuilder]: For program point L139(line 139) no Hoare annotation was computed. [2022-07-11 23:46:51,163 INFO L899 garLoopResultBuilder]: For program point L106-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,163 INFO L902 garLoopResultBuilder]: At program point L189(lines 7 193) the Hoare annotation is: true [2022-07-11 23:46:51,163 INFO L899 garLoopResultBuilder]: For program point L90-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,163 INFO L899 garLoopResultBuilder]: For program point L173-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,163 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-11 23:46:51,163 INFO L899 garLoopResultBuilder]: For program point L174(line 174) no Hoare annotation was computed. [2022-07-11 23:46:51,163 INFO L899 garLoopResultBuilder]: For program point L158-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,164 INFO L902 garLoopResultBuilder]: At program point L192(lines 6 193) the Hoare annotation is: true [2022-07-11 23:46:51,164 INFO L899 garLoopResultBuilder]: For program point L159(line 159) no Hoare annotation was computed. [2022-07-11 23:46:51,164 INFO L899 garLoopResultBuilder]: For program point L143-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,164 INFO L899 garLoopResultBuilder]: For program point L110-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,164 INFO L899 garLoopResultBuilder]: For program point L94-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,164 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-11 23:46:51,165 INFO L899 garLoopResultBuilder]: For program point L144(line 144) no Hoare annotation was computed. [2022-07-11 23:46:51,165 INFO L899 garLoopResultBuilder]: For program point L78(lines 78 80) no Hoare annotation was computed. [2022-07-11 23:46:51,165 INFO L899 garLoopResultBuilder]: For program point L78-2(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,165 INFO L899 garLoopResultBuilder]: For program point L128-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,165 INFO L899 garLoopResultBuilder]: For program point L178-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,165 INFO L899 garLoopResultBuilder]: For program point L129(line 129) no Hoare annotation was computed. [2022-07-11 23:46:51,165 INFO L899 garLoopResultBuilder]: For program point L179(line 179) no Hoare annotation was computed. [2022-07-11 23:46:51,165 INFO L899 garLoopResultBuilder]: For program point L163-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,166 INFO L899 garLoopResultBuilder]: For program point L114-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,166 INFO L899 garLoopResultBuilder]: For program point L164(line 164) no Hoare annotation was computed. [2022-07-11 23:46:51,166 INFO L899 garLoopResultBuilder]: For program point L98-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,166 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-11 23:46:51,166 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 191) no Hoare annotation was computed. [2022-07-11 23:46:51,166 INFO L899 garLoopResultBuilder]: For program point L148-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,167 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 51) no Hoare annotation was computed. [2022-07-11 23:46:51,167 INFO L899 garLoopResultBuilder]: For program point L82-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,167 INFO L899 garLoopResultBuilder]: For program point L149(line 149) no Hoare annotation was computed. [2022-07-11 23:46:51,167 INFO L899 garLoopResultBuilder]: For program point L133-1(lines 47 188) no Hoare annotation was computed. [2022-07-11 23:46:51,167 INFO L902 garLoopResultBuilder]: At program point L183-1(lines 47 188) the Hoare annotation is: true [2022-07-11 23:46:51,167 INFO L899 garLoopResultBuilder]: For program point L134(line 134) no Hoare annotation was computed. [2022-07-11 23:46:51,172 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:46:51,173 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-11 23:46:51,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 11:46:51 BoogieIcfgContainer [2022-07-11 23:46:51,182 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-11 23:46:51,183 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-11 23:46:51,183 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-11 23:46:51,183 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-11 23:46:51,183 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:46:36" (3/4) ... [2022-07-11 23:46:51,187 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-11 23:46:51,196 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-11 23:46:51,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-07-11 23:46:51,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-11 23:46:51,197 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-11 23:46:51,233 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-11 23:46:51,234 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-11 23:46:51,234 INFO L158 Benchmark]: Toolchain (without parser) took 15637.28ms. Allocated memory was 104.9MB in the beginning and 10.7GB in the end (delta: 10.6GB). Free memory was 72.4MB in the beginning and 9.4GB in the end (delta: -9.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-07-11 23:46:51,234 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory was 59.5MB in the beginning and 59.4MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:46:51,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.78ms. Allocated memory is still 104.9MB. Free memory was 72.2MB in the beginning and 78.4MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-11 23:46:51,236 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.22ms. Allocated memory is still 104.9MB. Free memory was 78.4MB in the beginning and 76.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-11 23:46:51,240 INFO L158 Benchmark]: Boogie Preprocessor took 14.96ms. Allocated memory is still 104.9MB. Free memory was 76.3MB in the beginning and 75.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-11 23:46:51,240 INFO L158 Benchmark]: RCFGBuilder took 309.58ms. Allocated memory is still 104.9MB. Free memory was 75.0MB in the beginning and 61.7MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-11 23:46:51,240 INFO L158 Benchmark]: TraceAbstraction took 14983.49ms. Allocated memory was 104.9MB in the beginning and 10.7GB in the end (delta: 10.6GB). Free memory was 61.0MB in the beginning and 9.4GB in the end (delta: -9.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2022-07-11 23:46:51,240 INFO L158 Benchmark]: Witness Printer took 51.06ms. Allocated memory is still 10.7GB. Free memory was 9.4GB in the beginning and 9.4GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-11 23:46:51,242 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.15ms. Allocated memory is still 104.9MB. Free memory was 59.5MB in the beginning and 59.4MB in the end (delta: 48.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.78ms. Allocated memory is still 104.9MB. Free memory was 72.2MB in the beginning and 78.4MB in the end (delta: -6.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.22ms. Allocated memory is still 104.9MB. Free memory was 78.4MB in the beginning and 76.3MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.96ms. Allocated memory is still 104.9MB. Free memory was 76.3MB in the beginning and 75.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 309.58ms. Allocated memory is still 104.9MB. Free memory was 75.0MB in the beginning and 61.7MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14983.49ms. Allocated memory was 104.9MB in the beginning and 10.7GB in the end (delta: 10.6GB). Free memory was 61.0MB in the beginning and 9.4GB in the end (delta: -9.4GB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 51.06ms. Allocated memory is still 10.7GB. Free memory was 9.4GB in the beginning and 9.4GB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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: 191]: 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, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.9s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1629 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1629 mSDsluCounter, 5405 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2174 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 175 IncrementalHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 3231 mSDtfsCounter, 175 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 99 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105477occurred in iteration=32, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 16418 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 4105 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.5s InterpolantComputationTime, 811 NumberOfCodeBlocks, 811 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 778 ConstructedInterpolants, 0 QuantifiedInterpolants, 1702 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-07-11 23:46:51,279 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