./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_11.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/locks/test_locks_11.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8 --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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-2329fc7 [2022-12-13 20:20:54,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:20:54,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:20:54,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:20:54,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:20:54,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:20:54,631 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:20:54,632 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:20:54,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:20:54,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:20:54,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:20:54,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:20:54,637 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:20:54,638 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:20:54,639 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:20:54,640 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:20:54,641 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:20:54,642 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:20:54,644 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:20:54,645 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:20:54,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:20:54,648 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:20:54,649 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:20:54,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:20:54,653 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:20:54,654 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:20:54,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:20:54,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:20:54,656 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:20:54,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:20:54,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:20:54,658 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:20:54,658 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:20:54,659 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:20:54,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:20:54,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:20:54,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:20:54,661 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:20:54,661 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:20:54,662 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:20:54,663 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:20:54,664 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 20:20:54,677 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:20:54,677 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:20:54,677 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:20:54,677 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:20:54,678 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:20:54,678 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:20:54,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:20:54,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:20:54,678 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:20:54,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:20:54,679 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:20:54,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:20:54,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:20:54,679 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:20:54,679 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:20:54,679 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:20:54,679 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:20:54,680 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:20:54,680 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:20:54,680 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:20:54,680 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:20:54,680 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:20:54,680 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:20:54,680 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:20:54,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:20:54,681 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:20:54,681 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:20:54,681 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:20:54,681 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:20:54,681 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:20:54,681 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:20:54,682 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:20:54,682 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:20:54,682 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:20:54,682 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:20:54,682 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2022-12-13 20:20:54,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:20:54,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:20:54,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:20:54,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:20:54,874 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:20:54,875 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/locks/test_locks_11.c [2022-12-13 20:20:57,469 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:20:57,648 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:20:57,649 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/sv-benchmarks/c/locks/test_locks_11.c [2022-12-13 20:20:57,655 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/data/f3147698e/92db440935d14358a06ed4fba622bf72/FLAGcea58f5b5 [2022-12-13 20:20:58,032 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/data/f3147698e/92db440935d14358a06ed4fba622bf72 [2022-12-13 20:20:58,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:20:58,037 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:20:58,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:20:58,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:20:58,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:20:58,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,046 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28101c38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58, skipping insertion in model container [2022-12-13 20:20:58,046 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,052 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:20:58,067 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:20:58,194 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2022-12-13 20:20:58,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:20:58,207 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:20:58,228 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2022-12-13 20:20:58,229 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:20:58,242 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:20:58,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58 WrapperNode [2022-12-13 20:20:58,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:20:58,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:20:58,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:20:58,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:20:58,251 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,256 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,274 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2022-12-13 20:20:58,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:20:58,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:20:58,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:20:58,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:20:58,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,283 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,292 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,293 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,295 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:20:58,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:20:58,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:20:58,296 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:20:58,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58" (1/1) ... [2022-12-13 20:20:58,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:20:58,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:20:58,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:20:58,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:20:58,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:20:58,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:20:58,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:20:58,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:20:58,408 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:20:58,409 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:20:58,553 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:20:58,558 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:20:58,558 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 20:20:58,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:20:58 BoogieIcfgContainer [2022-12-13 20:20:58,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:20:58,561 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:20:58,561 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:20:58,564 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:20:58,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:20:58" (1/3) ... [2022-12-13 20:20:58,564 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21345ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:20:58, skipping insertion in model container [2022-12-13 20:20:58,564 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:20:58" (2/3) ... [2022-12-13 20:20:58,565 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21345ec7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:20:58, skipping insertion in model container [2022-12-13 20:20:58,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:20:58" (3/3) ... [2022-12-13 20:20:58,566 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2022-12-13 20:20:58,579 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:20:58,579 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 20:20:58,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:20:58,617 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@48c4a589, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:20:58,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 20:20:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 42 states have internal predecessors, (78), 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-12-13 20:20:58,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 20:20:58,624 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:58,625 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:20:58,625 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:58,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:58,629 INFO L85 PathProgramCache]: Analyzing trace with hash 458919617, now seen corresponding path program 1 times [2022-12-13 20:20:58,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:58,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094779843] [2022-12-13 20:20:58,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:58,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:58,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:58,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094779843] [2022-12-13 20:20:58,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094779843] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:58,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:58,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:58,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940240048] [2022-12-13 20:20:58,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:58,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:58,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:58,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:58,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:58,824 INFO L87 Difference]: Start difference. First operand has 43 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 42 states have internal predecessors, (78), 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.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:20:58,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:58,857 INFO L93 Difference]: Finished difference Result 89 states and 157 transitions. [2022-12-13 20:20:58,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:58,859 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 20:20:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:58,866 INFO L225 Difference]: With dead ends: 89 [2022-12-13 20:20:58,866 INFO L226 Difference]: Without dead ends: 75 [2022-12-13 20:20:58,868 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-12-13 20:20:58,871 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 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-12-13 20:20:58,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 151 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:58,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-13 20:20:58,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2022-12-13 20:20:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 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-12-13 20:20:58,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 94 transitions. [2022-12-13 20:20:58,898 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 94 transitions. Word has length 18 [2022-12-13 20:20:58,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:58,898 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 94 transitions. [2022-12-13 20:20:58,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:20:58,898 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 94 transitions. [2022-12-13 20:20:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-12-13 20:20:58,899 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:58,899 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:20:58,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:20:58,899 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:58,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:58,900 INFO L85 PathProgramCache]: Analyzing trace with hash -552197633, now seen corresponding path program 1 times [2022-12-13 20:20:58,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:58,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650609199] [2022-12-13 20:20:58,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:58,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:58,950 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:58,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:58,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650609199] [2022-12-13 20:20:58,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650609199] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:58,951 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:58,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:58,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635416549] [2022-12-13 20:20:58,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:58,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:58,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:58,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:58,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:58,953 INFO L87 Difference]: Start difference. First operand 51 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:20:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:58,972 INFO L93 Difference]: Finished difference Result 124 states and 229 transitions. [2022-12-13 20:20:58,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:58,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-12-13 20:20:58,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:58,974 INFO L225 Difference]: With dead ends: 124 [2022-12-13 20:20:58,974 INFO L226 Difference]: Without dead ends: 75 [2022-12-13 20:20:58,975 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-12-13 20:20:58,976 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 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-12-13 20:20:58,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 157 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-12-13 20:20:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-12-13 20:20:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 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-12-13 20:20:58,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 134 transitions. [2022-12-13 20:20:58,983 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 134 transitions. Word has length 18 [2022-12-13 20:20:58,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:58,983 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 134 transitions. [2022-12-13 20:20:58,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-13 20:20:58,983 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 134 transitions. [2022-12-13 20:20:58,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 20:20:58,984 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:58,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] [2022-12-13 20:20:58,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-13 20:20:58,984 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:58,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:58,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1341819263, now seen corresponding path program 1 times [2022-12-13 20:20:58,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:58,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649519802] [2022-12-13 20:20:58,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:58,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:58,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649519802] [2022-12-13 20:20:59,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649519802] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,030 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649882920] [2022-12-13 20:20:59,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,032 INFO L87 Difference]: Start difference. First operand 73 states and 134 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-12-13 20:20:59,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,048 INFO L93 Difference]: Finished difference Result 114 states and 204 transitions. [2022-12-13 20:20:59,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,049 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-12-13 20:20:59,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,050 INFO L225 Difference]: With dead ends: 114 [2022-12-13 20:20:59,050 INFO L226 Difference]: Without dead ends: 78 [2022-12-13 20:20:59,051 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-12-13 20:20:59,052 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 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-12-13 20:20:59,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 176 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-12-13 20:20:59,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-12-13 20:20:59,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 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-12-13 20:20:59,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 136 transitions. [2022-12-13 20:20:59,058 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 136 transitions. Word has length 19 [2022-12-13 20:20:59,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,058 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 136 transitions. [2022-12-13 20:20:59,058 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-12-13 20:20:59,058 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 136 transitions. [2022-12-13 20:20:59,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 20:20:59,059 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,059 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-12-13 20:20:59,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-13 20:20:59,059 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,060 INFO L85 PathProgramCache]: Analyzing trace with hash 61955585, now seen corresponding path program 1 times [2022-12-13 20:20:59,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008297437] [2022-12-13 20:20:59,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008297437] [2022-12-13 20:20:59,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008297437] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,094 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783433056] [2022-12-13 20:20:59,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,096 INFO L87 Difference]: Start difference. First operand 76 states and 136 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-12-13 20:20:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,111 INFO L93 Difference]: Finished difference Result 145 states and 261 transitions. [2022-12-13 20:20:59,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,111 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-12-13 20:20:59,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,112 INFO L225 Difference]: With dead ends: 145 [2022-12-13 20:20:59,112 INFO L226 Difference]: Without dead ends: 143 [2022-12-13 20:20:59,112 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-12-13 20:20:59,113 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 50 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 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-12-13 20:20:59,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 137 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-12-13 20:20:59,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2022-12-13 20:20:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 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-12-13 20:20:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 181 transitions. [2022-12-13 20:20:59,120 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 181 transitions. Word has length 19 [2022-12-13 20:20:59,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,120 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 181 transitions. [2022-12-13 20:20:59,120 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-12-13 20:20:59,120 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 181 transitions. [2022-12-13 20:20:59,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-13 20:20:59,121 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,121 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-12-13 20:20:59,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-13 20:20:59,121 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,121 INFO L85 PathProgramCache]: Analyzing trace with hash -949161665, now seen corresponding path program 1 times [2022-12-13 20:20:59,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006647519] [2022-12-13 20:20:59,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006647519] [2022-12-13 20:20:59,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006647519] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366550548] [2022-12-13 20:20:59,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,154 INFO L87 Difference]: Start difference. First operand 101 states and 181 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-12-13 20:20:59,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,167 INFO L93 Difference]: Finished difference Result 241 states and 435 transitions. [2022-12-13 20:20:59,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,168 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-12-13 20:20:59,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,169 INFO L225 Difference]: With dead ends: 241 [2022-12-13 20:20:59,170 INFO L226 Difference]: Without dead ends: 145 [2022-12-13 20:20:59,170 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-12-13 20:20:59,172 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 158 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-12-13 20:20:59,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 158 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-12-13 20:20:59,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2022-12-13 20:20:59,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 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-12-13 20:20:59,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 255 transitions. [2022-12-13 20:20:59,179 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 255 transitions. Word has length 19 [2022-12-13 20:20:59,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,179 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 255 transitions. [2022-12-13 20:20:59,179 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-12-13 20:20:59,179 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 255 transitions. [2022-12-13 20:20:59,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 20:20:59,180 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,180 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-12-13 20:20:59,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-13 20:20:59,180 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1920836500, now seen corresponding path program 1 times [2022-12-13 20:20:59,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226064870] [2022-12-13 20:20:59,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226064870] [2022-12-13 20:20:59,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226064870] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251701977] [2022-12-13 20:20:59,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,209 INFO L87 Difference]: Start difference. First operand 143 states and 255 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-12-13 20:20:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,222 INFO L93 Difference]: Finished difference Result 216 states and 382 transitions. [2022-12-13 20:20:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,223 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-12-13 20:20:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,224 INFO L225 Difference]: With dead ends: 216 [2022-12-13 20:20:59,224 INFO L226 Difference]: Without dead ends: 147 [2022-12-13 20:20:59,224 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-12-13 20:20:59,225 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 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-12-13 20:20:59,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 172 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-12-13 20:20:59,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2022-12-13 20:20:59,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 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-12-13 20:20:59,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 255 transitions. [2022-12-13 20:20:59,231 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 255 transitions. Word has length 20 [2022-12-13 20:20:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,232 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 255 transitions. [2022-12-13 20:20:59,232 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-12-13 20:20:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 255 transitions. [2022-12-13 20:20:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 20:20:59,232 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,232 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-12-13 20:20:59,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-13 20:20:59,233 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,233 INFO L85 PathProgramCache]: Analyzing trace with hash 640972822, now seen corresponding path program 1 times [2022-12-13 20:20:59,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198488120] [2022-12-13 20:20:59,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198488120] [2022-12-13 20:20:59,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198488120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396088065] [2022-12-13 20:20:59,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,267 INFO L87 Difference]: Start difference. First operand 145 states and 255 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-12-13 20:20:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,290 INFO L93 Difference]: Finished difference Result 417 states and 737 transitions. [2022-12-13 20:20:59,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,291 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-12-13 20:20:59,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,292 INFO L225 Difference]: With dead ends: 417 [2022-12-13 20:20:59,293 INFO L226 Difference]: Without dead ends: 279 [2022-12-13 20:20:59,293 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-12-13 20:20:59,294 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 139 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-12-13 20:20:59,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 139 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-12-13 20:20:59,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2022-12-13 20:20:59,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 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-12-13 20:20:59,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 483 transitions. [2022-12-13 20:20:59,309 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 483 transitions. Word has length 20 [2022-12-13 20:20:59,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,309 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 483 transitions. [2022-12-13 20:20:59,309 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-12-13 20:20:59,310 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 483 transitions. [2022-12-13 20:20:59,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-12-13 20:20:59,311 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,311 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-12-13 20:20:59,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-13 20:20:59,311 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1652090072, now seen corresponding path program 1 times [2022-12-13 20:20:59,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296442835] [2022-12-13 20:20:59,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296442835] [2022-12-13 20:20:59,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296442835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929856244] [2022-12-13 20:20:59,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,349 INFO L87 Difference]: Start difference. First operand 277 states and 483 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-12-13 20:20:59,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,363 INFO L93 Difference]: Finished difference Result 353 states and 621 transitions. [2022-12-13 20:20:59,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,364 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-12-13 20:20:59,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,365 INFO L225 Difference]: With dead ends: 353 [2022-12-13 20:20:59,366 INFO L226 Difference]: Without dead ends: 351 [2022-12-13 20:20:59,366 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-12-13 20:20:59,367 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 188 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-12-13 20:20:59,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 188 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-12-13 20:20:59,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 277. [2022-12-13 20:20:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 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-12-13 20:20:59,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 479 transitions. [2022-12-13 20:20:59,380 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 479 transitions. Word has length 20 [2022-12-13 20:20:59,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,380 INFO L495 AbstractCegarLoop]: Abstraction has 277 states and 479 transitions. [2022-12-13 20:20:59,380 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-12-13 20:20:59,380 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 479 transitions. [2022-12-13 20:20:59,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 20:20:59,381 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,382 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-12-13 20:20:59,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-13 20:20:59,382 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1604465292, now seen corresponding path program 1 times [2022-12-13 20:20:59,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,383 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031543103] [2022-12-13 20:20:59,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031543103] [2022-12-13 20:20:59,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031543103] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,411 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,411 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525612620] [2022-12-13 20:20:59,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,412 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,413 INFO L87 Difference]: Start difference. First operand 277 states and 479 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-12-13 20:20:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,429 INFO L93 Difference]: Finished difference Result 517 states and 905 transitions. [2022-12-13 20:20:59,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,430 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-12-13 20:20:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,432 INFO L225 Difference]: With dead ends: 517 [2022-12-13 20:20:59,432 INFO L226 Difference]: Without dead ends: 515 [2022-12-13 20:20:59,432 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-12-13 20:20:59,433 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 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-12-13 20:20:59,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-12-13 20:20:59,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 385. [2022-12-13 20:20:59,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 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-12-13 20:20:59,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 655 transitions. [2022-12-13 20:20:59,445 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 655 transitions. Word has length 21 [2022-12-13 20:20:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,445 INFO L495 AbstractCegarLoop]: Abstraction has 385 states and 655 transitions. [2022-12-13 20:20:59,445 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-12-13 20:20:59,445 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 655 transitions. [2022-12-13 20:20:59,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-12-13 20:20:59,446 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,446 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-12-13 20:20:59,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-13 20:20:59,447 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1679384754, now seen corresponding path program 1 times [2022-12-13 20:20:59,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108012130] [2022-12-13 20:20:59,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108012130] [2022-12-13 20:20:59,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108012130] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044518121] [2022-12-13 20:20:59,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,467 INFO L87 Difference]: Start difference. First operand 385 states and 655 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-12-13 20:20:59,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,485 INFO L93 Difference]: Finished difference Result 917 states and 1569 transitions. [2022-12-13 20:20:59,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,486 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-12-13 20:20:59,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,488 INFO L225 Difference]: With dead ends: 917 [2022-12-13 20:20:59,488 INFO L226 Difference]: Without dead ends: 539 [2022-12-13 20:20:59,489 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-12-13 20:20:59,490 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 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-12-13 20:20:59,490 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 160 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-12-13 20:20:59,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2022-12-13 20:20:59,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 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-12-13 20:20:59,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 907 transitions. [2022-12-13 20:20:59,503 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 907 transitions. Word has length 21 [2022-12-13 20:20:59,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,504 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 907 transitions. [2022-12-13 20:20:59,504 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-12-13 20:20:59,504 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 907 transitions. [2022-12-13 20:20:59,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 20:20:59,505 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,505 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-12-13 20:20:59,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-12-13 20:20:59,505 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1801397547, now seen corresponding path program 1 times [2022-12-13 20:20:59,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69705360] [2022-12-13 20:20:59,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69705360] [2022-12-13 20:20:59,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69705360] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,524 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148421084] [2022-12-13 20:20:59,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,525 INFO L87 Difference]: Start difference. First operand 537 states and 907 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-12-13 20:20:59,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,538 INFO L93 Difference]: Finished difference Result 813 states and 1369 transitions. [2022-12-13 20:20:59,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,538 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-12-13 20:20:59,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,539 INFO L225 Difference]: With dead ends: 813 [2022-12-13 20:20:59,539 INFO L226 Difference]: Without dead ends: 551 [2022-12-13 20:20:59,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,540 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 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-12-13 20:20:59,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 164 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-12-13 20:20:59,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2022-12-13 20:20:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 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-12-13 20:20:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 915 transitions. [2022-12-13 20:20:59,551 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 915 transitions. Word has length 22 [2022-12-13 20:20:59,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,551 INFO L495 AbstractCegarLoop]: Abstraction has 549 states and 915 transitions. [2022-12-13 20:20:59,552 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-12-13 20:20:59,552 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 915 transitions. [2022-12-13 20:20:59,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 20:20:59,552 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,552 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-12-13 20:20:59,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-13 20:20:59,552 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,553 INFO L85 PathProgramCache]: Analyzing trace with hash 521533869, now seen corresponding path program 1 times [2022-12-13 20:20:59,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035278143] [2022-12-13 20:20:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035278143] [2022-12-13 20:20:59,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035278143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,570 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,570 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,570 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087799292] [2022-12-13 20:20:59,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,571 INFO L87 Difference]: Start difference. First operand 549 states and 915 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-12-13 20:20:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,589 INFO L93 Difference]: Finished difference Result 1001 states and 1693 transitions. [2022-12-13 20:20:59,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,589 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-12-13 20:20:59,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,591 INFO L225 Difference]: With dead ends: 1001 [2022-12-13 20:20:59,591 INFO L226 Difference]: Without dead ends: 999 [2022-12-13 20:20:59,592 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-12-13 20:20:59,592 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 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-12-13 20:20:59,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 131 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-12-13 20:20:59,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 773. [2022-12-13 20:20:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 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-12-13 20:20:59,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1259 transitions. [2022-12-13 20:20:59,615 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1259 transitions. Word has length 22 [2022-12-13 20:20:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,615 INFO L495 AbstractCegarLoop]: Abstraction has 773 states and 1259 transitions. [2022-12-13 20:20:59,615 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-12-13 20:20:59,615 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1259 transitions. [2022-12-13 20:20:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-12-13 20:20:59,617 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,617 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-12-13 20:20:59,617 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-12-13 20:20:59,617 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,618 INFO L85 PathProgramCache]: Analyzing trace with hash -489583381, now seen corresponding path program 1 times [2022-12-13 20:20:59,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286704761] [2022-12-13 20:20:59,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,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-12-13 20:20:59,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286704761] [2022-12-13 20:20:59,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286704761] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812702082] [2022-12-13 20:20:59,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,636 INFO L87 Difference]: Start difference. First operand 773 states and 1259 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-12-13 20:20:59,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,655 INFO L93 Difference]: Finished difference Result 1817 states and 2973 transitions. [2022-12-13 20:20:59,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,655 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-12-13 20:20:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,657 INFO L225 Difference]: With dead ends: 1817 [2022-12-13 20:20:59,657 INFO L226 Difference]: Without dead ends: 1063 [2022-12-13 20:20:59,658 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-12-13 20:20:59,658 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 161 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-12-13 20:20:59,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 161 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-12-13 20:20:59,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2022-12-13 20:20:59,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 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-12-13 20:20:59,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1715 transitions. [2022-12-13 20:20:59,679 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1715 transitions. Word has length 22 [2022-12-13 20:20:59,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,679 INFO L495 AbstractCegarLoop]: Abstraction has 1061 states and 1715 transitions. [2022-12-13 20:20:59,679 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-12-13 20:20:59,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1715 transitions. [2022-12-13 20:20:59,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 20:20:59,680 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,680 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-12-13 20:20:59,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-13 20:20:59,680 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1012104857, now seen corresponding path program 1 times [2022-12-13 20:20:59,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [582417864] [2022-12-13 20:20:59,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [582417864] [2022-12-13 20:20:59,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [582417864] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910519427] [2022-12-13 20:20:59,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,696 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,697 INFO L87 Difference]: Start difference. First operand 1061 states and 1715 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-12-13 20:20:59,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,716 INFO L93 Difference]: Finished difference Result 1593 states and 2565 transitions. [2022-12-13 20:20:59,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,716 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-12-13 20:20:59,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,718 INFO L225 Difference]: With dead ends: 1593 [2022-12-13 20:20:59,718 INFO L226 Difference]: Without dead ends: 1079 [2022-12-13 20:20:59,719 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-12-13 20:20:59,719 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 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-12-13 20:20:59,719 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 160 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2022-12-13 20:20:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077. [2022-12-13 20:20:59,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 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-12-13 20:20:59,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1715 transitions. [2022-12-13 20:20:59,742 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1715 transitions. Word has length 23 [2022-12-13 20:20:59,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,742 INFO L495 AbstractCegarLoop]: Abstraction has 1077 states and 1715 transitions. [2022-12-13 20:20:59,742 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-12-13 20:20:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1715 transitions. [2022-12-13 20:20:59,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 20:20:59,743 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,743 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-12-13 20:20:59,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-12-13 20:20:59,743 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,744 INFO L85 PathProgramCache]: Analyzing trace with hash 2002998761, now seen corresponding path program 1 times [2022-12-13 20:20:59,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402969874] [2022-12-13 20:20:59,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402969874] [2022-12-13 20:20:59,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402969874] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489787061] [2022-12-13 20:20:59,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,761 INFO L87 Difference]: Start difference. First operand 1077 states and 1715 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-12-13 20:20:59,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,805 INFO L93 Difference]: Finished difference Result 1929 states and 3125 transitions. [2022-12-13 20:20:59,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,806 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-12-13 20:20:59,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,809 INFO L225 Difference]: With dead ends: 1929 [2022-12-13 20:20:59,809 INFO L226 Difference]: Without dead ends: 1927 [2022-12-13 20:20:59,810 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-12-13 20:20:59,810 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 129 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-12-13 20:20:59,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 129 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2022-12-13 20:20:59,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1541. [2022-12-13 20:20:59,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 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-12-13 20:20:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2387 transitions. [2022-12-13 20:20:59,845 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2387 transitions. Word has length 23 [2022-12-13 20:20:59,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,846 INFO L495 AbstractCegarLoop]: Abstraction has 1541 states and 2387 transitions. [2022-12-13 20:20:59,846 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-12-13 20:20:59,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2387 transitions. [2022-12-13 20:20:59,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-12-13 20:20:59,847 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,847 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-12-13 20:20:59,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-13 20:20:59,847 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,847 INFO L85 PathProgramCache]: Analyzing trace with hash 991881511, now seen corresponding path program 1 times [2022-12-13 20:20:59,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056472321] [2022-12-13 20:20:59,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056472321] [2022-12-13 20:20:59,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056472321] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643306314] [2022-12-13 20:20:59,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,863 INFO L87 Difference]: Start difference. First operand 1541 states and 2387 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-12-13 20:20:59,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:20:59,895 INFO L93 Difference]: Finished difference Result 3593 states and 5589 transitions. [2022-12-13 20:20:59,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:20:59,896 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-12-13 20:20:59,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:20:59,899 INFO L225 Difference]: With dead ends: 3593 [2022-12-13 20:20:59,899 INFO L226 Difference]: Without dead ends: 2087 [2022-12-13 20:20:59,901 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-12-13 20:20:59,901 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 162 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-12-13 20:20:59,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 162 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:20:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2022-12-13 20:20:59,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2085. [2022-12-13 20:20:59,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 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-12-13 20:20:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3203 transitions. [2022-12-13 20:20:59,945 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3203 transitions. Word has length 23 [2022-12-13 20:20:59,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:20:59,945 INFO L495 AbstractCegarLoop]: Abstraction has 2085 states and 3203 transitions. [2022-12-13 20:20:59,945 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-12-13 20:20:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3203 transitions. [2022-12-13 20:20:59,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 20:20:59,946 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:20:59,946 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-12-13 20:20:59,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-13 20:20:59,946 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:20:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:20:59,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1963634176, now seen corresponding path program 1 times [2022-12-13 20:20:59,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:20:59,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725301135] [2022-12-13 20:20:59,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:20:59,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:20:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:20:59,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:20:59,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:20:59,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725301135] [2022-12-13 20:20:59,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725301135] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:20:59,966 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:20:59,966 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:20:59,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664446979] [2022-12-13 20:20:59,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:20:59,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:20:59,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:20:59,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:20:59,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:20:59,968 INFO L87 Difference]: Start difference. First operand 2085 states and 3203 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-12-13 20:21:00,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:00,015 INFO L93 Difference]: Finished difference Result 3129 states and 4789 transitions. [2022-12-13 20:21:00,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:00,015 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-12-13 20:21:00,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:00,021 INFO L225 Difference]: With dead ends: 3129 [2022-12-13 20:21:00,021 INFO L226 Difference]: Without dead ends: 2119 [2022-12-13 20:21:00,023 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-12-13 20:21:00,023 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 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-12-13 20:21:00,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:00,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-12-13 20:21:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2117. [2022-12-13 20:21:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 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-12-13 20:21:00,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3203 transitions. [2022-12-13 20:21:00,086 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3203 transitions. Word has length 24 [2022-12-13 20:21:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:00,086 INFO L495 AbstractCegarLoop]: Abstraction has 2117 states and 3203 transitions. [2022-12-13 20:21:00,086 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-12-13 20:21:00,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3203 transitions. [2022-12-13 20:21:00,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 20:21:00,087 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:00,087 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-12-13 20:21:00,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-13 20:21:00,088 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:00,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:00,088 INFO L85 PathProgramCache]: Analyzing trace with hash 683770498, now seen corresponding path program 1 times [2022-12-13 20:21:00,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:00,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684319374] [2022-12-13 20:21:00,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:00,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:00,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:00,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:00,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684319374] [2022-12-13 20:21:00,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1684319374] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:00,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:00,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:00,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357265379] [2022-12-13 20:21:00,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:00,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:00,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:00,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:00,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:00,106 INFO L87 Difference]: Start difference. First operand 2117 states and 3203 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-12-13 20:21:00,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:00,160 INFO L93 Difference]: Finished difference Result 3721 states and 5733 transitions. [2022-12-13 20:21:00,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:00,160 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-12-13 20:21:00,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:00,172 INFO L225 Difference]: With dead ends: 3721 [2022-12-13 20:21:00,172 INFO L226 Difference]: Without dead ends: 3719 [2022-12-13 20:21:00,173 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-12-13 20:21:00,174 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 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-12-13 20:21:00,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:00,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2022-12-13 20:21:00,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3077. [2022-12-13 20:21:00,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 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-12-13 20:21:00,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4515 transitions. [2022-12-13 20:21:00,241 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4515 transitions. Word has length 24 [2022-12-13 20:21:00,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:00,241 INFO L495 AbstractCegarLoop]: Abstraction has 3077 states and 4515 transitions. [2022-12-13 20:21:00,241 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-12-13 20:21:00,241 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4515 transitions. [2022-12-13 20:21:00,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-12-13 20:21:00,243 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:00,243 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-12-13 20:21:00,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-12-13 20:21:00,244 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:00,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:00,244 INFO L85 PathProgramCache]: Analyzing trace with hash -327346752, now seen corresponding path program 1 times [2022-12-13 20:21:00,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:00,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202458783] [2022-12-13 20:21:00,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:00,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:00,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:00,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:00,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202458783] [2022-12-13 20:21:00,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202458783] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:00,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:00,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:00,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137507965] [2022-12-13 20:21:00,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:00,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:00,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:00,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:00,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:00,262 INFO L87 Difference]: Start difference. First operand 3077 states and 4515 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-12-13 20:21:00,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:00,331 INFO L93 Difference]: Finished difference Result 7113 states and 10469 transitions. [2022-12-13 20:21:00,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:00,332 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-12-13 20:21:00,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:00,344 INFO L225 Difference]: With dead ends: 7113 [2022-12-13 20:21:00,344 INFO L226 Difference]: Without dead ends: 4103 [2022-12-13 20:21:00,346 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-12-13 20:21:00,347 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 163 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-12-13 20:21:00,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:00,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2022-12-13 20:21:00,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4101. [2022-12-13 20:21:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 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-12-13 20:21:00,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5955 transitions. [2022-12-13 20:21:00,445 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5955 transitions. Word has length 24 [2022-12-13 20:21:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:00,445 INFO L495 AbstractCegarLoop]: Abstraction has 4101 states and 5955 transitions. [2022-12-13 20:21:00,445 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-12-13 20:21:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5955 transitions. [2022-12-13 20:21:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 20:21:00,448 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:00,448 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-12-13 20:21:00,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-12-13 20:21:00,448 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:00,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:00,448 INFO L85 PathProgramCache]: Analyzing trace with hash -277735972, now seen corresponding path program 1 times [2022-12-13 20:21:00,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:00,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787958078] [2022-12-13 20:21:00,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:00,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:00,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787958078] [2022-12-13 20:21:00,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787958078] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:00,463 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:00,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:00,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668924810] [2022-12-13 20:21:00,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:00,464 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:00,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:00,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:00,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:00,465 INFO L87 Difference]: Start difference. First operand 4101 states and 5955 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-12-13 20:21:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:00,543 INFO L93 Difference]: Finished difference Result 6153 states and 8901 transitions. [2022-12-13 20:21:00,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:00,543 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-12-13 20:21:00,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:00,554 INFO L225 Difference]: With dead ends: 6153 [2022-12-13 20:21:00,554 INFO L226 Difference]: Without dead ends: 4167 [2022-12-13 20:21:00,556 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-12-13 20:21:00,556 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 152 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-12-13 20:21:00,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 152 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:00,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2022-12-13 20:21:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 4165. [2022-12-13 20:21:00,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 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-12-13 20:21:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5955 transitions. [2022-12-13 20:21:00,655 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5955 transitions. Word has length 25 [2022-12-13 20:21:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:00,656 INFO L495 AbstractCegarLoop]: Abstraction has 4165 states and 5955 transitions. [2022-12-13 20:21:00,656 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-12-13 20:21:00,656 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5955 transitions. [2022-12-13 20:21:00,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 20:21:00,661 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:00,661 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-12-13 20:21:00,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-12-13 20:21:00,661 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:00,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:00,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1557599650, now seen corresponding path program 1 times [2022-12-13 20:21:00,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:00,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730115986] [2022-12-13 20:21:00,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:00,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:00,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:00,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:00,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730115986] [2022-12-13 20:21:00,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730115986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:00,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:00,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:00,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554644810] [2022-12-13 20:21:00,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:00,677 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:00,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:00,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:00,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:00,678 INFO L87 Difference]: Start difference. First operand 4165 states and 5955 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-12-13 20:21:00,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:00,787 INFO L93 Difference]: Finished difference Result 7177 states and 10437 transitions. [2022-12-13 20:21:00,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:00,788 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-12-13 20:21:00,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:00,797 INFO L225 Difference]: With dead ends: 7177 [2022-12-13 20:21:00,797 INFO L226 Difference]: Without dead ends: 7175 [2022-12-13 20:21:00,798 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-12-13 20:21:00,799 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 125 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-12-13 20:21:00,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 125 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:00,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7175 states. [2022-12-13 20:21:00,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7175 to 6149. [2022-12-13 20:21:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 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-12-13 20:21:00,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 8515 transitions. [2022-12-13 20:21:00,920 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 8515 transitions. Word has length 25 [2022-12-13 20:21:00,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:00,920 INFO L495 AbstractCegarLoop]: Abstraction has 6149 states and 8515 transitions. [2022-12-13 20:21:00,921 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-12-13 20:21:00,921 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 8515 transitions. [2022-12-13 20:21:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-12-13 20:21:00,925 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:00,925 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-12-13 20:21:00,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-12-13 20:21:00,925 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:00,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:00,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1726250396, now seen corresponding path program 1 times [2022-12-13 20:21:00,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:00,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948006835] [2022-12-13 20:21:00,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:00,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:00,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:00,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948006835] [2022-12-13 20:21:00,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948006835] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:00,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:00,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:00,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705798738] [2022-12-13 20:21:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:00,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:00,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:00,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:00,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:00,941 INFO L87 Difference]: Start difference. First operand 6149 states and 8515 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-12-13 20:21:01,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:01,084 INFO L93 Difference]: Finished difference Result 14089 states and 19525 transitions. [2022-12-13 20:21:01,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:01,085 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-12-13 20:21:01,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:01,096 INFO L225 Difference]: With dead ends: 14089 [2022-12-13 20:21:01,096 INFO L226 Difference]: Without dead ends: 8071 [2022-12-13 20:21:01,100 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-12-13 20:21:01,101 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 164 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-12-13 20:21:01,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 164 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8071 states. [2022-12-13 20:21:01,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8071 to 8069. [2022-12-13 20:21:01,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 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-12-13 20:21:01,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 11011 transitions. [2022-12-13 20:21:01,314 INFO L78 Accepts]: Start accepts. Automaton has 8069 states and 11011 transitions. Word has length 25 [2022-12-13 20:21:01,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:01,314 INFO L495 AbstractCegarLoop]: Abstraction has 8069 states and 11011 transitions. [2022-12-13 20:21:01,314 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-12-13 20:21:01,314 INFO L276 IsEmpty]: Start isEmpty. Operand 8069 states and 11011 transitions. [2022-12-13 20:21:01,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 20:21:01,319 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:01,319 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-12-13 20:21:01,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-12-13 20:21:01,319 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:01,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:01,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1040733483, now seen corresponding path program 1 times [2022-12-13 20:21:01,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:01,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052570733] [2022-12-13 20:21:01,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:01,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:01,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:01,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:01,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052570733] [2022-12-13 20:21:01,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052570733] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:01,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:01,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:01,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438756708] [2022-12-13 20:21:01,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:01,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:01,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:01,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:01,335 INFO L87 Difference]: Start difference. First operand 8069 states and 11011 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-12-13 20:21:01,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:01,456 INFO L93 Difference]: Finished difference Result 12105 states and 16453 transitions. [2022-12-13 20:21:01,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:01,457 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-12-13 20:21:01,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:01,465 INFO L225 Difference]: With dead ends: 12105 [2022-12-13 20:21:01,465 INFO L226 Difference]: Without dead ends: 8199 [2022-12-13 20:21:01,469 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-12-13 20:21:01,469 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 148 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-12-13 20:21:01,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2022-12-13 20:21:01,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8197. [2022-12-13 20:21:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 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-12-13 20:21:01,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 11011 transitions. [2022-12-13 20:21:01,626 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 11011 transitions. Word has length 26 [2022-12-13 20:21:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:01,626 INFO L495 AbstractCegarLoop]: Abstraction has 8197 states and 11011 transitions. [2022-12-13 20:21:01,626 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-12-13 20:21:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 11011 transitions. [2022-12-13 20:21:01,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 20:21:01,631 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:01,631 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-12-13 20:21:01,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-12-13 20:21:01,631 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:01,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:01,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1974370135, now seen corresponding path program 1 times [2022-12-13 20:21:01,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:01,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749729972] [2022-12-13 20:21:01,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:01,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:01,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:01,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:01,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749729972] [2022-12-13 20:21:01,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749729972] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:01,645 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:01,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:01,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462300488] [2022-12-13 20:21:01,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:01,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:01,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:01,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:01,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:01,646 INFO L87 Difference]: Start difference. First operand 8197 states and 11011 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-12-13 20:21:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:01,849 INFO L93 Difference]: Finished difference Result 13833 states and 18821 transitions. [2022-12-13 20:21:01,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:01,849 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-12-13 20:21:01,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:01,865 INFO L225 Difference]: With dead ends: 13833 [2022-12-13 20:21:01,865 INFO L226 Difference]: Without dead ends: 13831 [2022-12-13 20:21:01,868 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-12-13 20:21:01,868 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 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-12-13 20:21:01,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13831 states. [2022-12-13 20:21:02,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13831 to 12293. [2022-12-13 20:21:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 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-12-13 20:21:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12293 states to 12293 states and 16003 transitions. [2022-12-13 20:21:02,120 INFO L78 Accepts]: Start accepts. Automaton has 12293 states and 16003 transitions. Word has length 26 [2022-12-13 20:21:02,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:02,120 INFO L495 AbstractCegarLoop]: Abstraction has 12293 states and 16003 transitions. [2022-12-13 20:21:02,120 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-12-13 20:21:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 12293 states and 16003 transitions. [2022-12-13 20:21:02,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-12-13 20:21:02,129 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:02,129 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-12-13 20:21:02,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-12-13 20:21:02,129 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:02,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:02,129 INFO L85 PathProgramCache]: Analyzing trace with hash 963252885, now seen corresponding path program 1 times [2022-12-13 20:21:02,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:02,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048793844] [2022-12-13 20:21:02,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:02,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:02,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:02,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:02,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048793844] [2022-12-13 20:21:02,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048793844] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:02,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:02,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:02,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169762177] [2022-12-13 20:21:02,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:02,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:02,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:02,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:02,144 INFO L87 Difference]: Start difference. First operand 12293 states and 16003 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-12-13 20:21:02,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:02,357 INFO L93 Difference]: Finished difference Result 27913 states and 36229 transitions. [2022-12-13 20:21:02,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:02,357 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-12-13 20:21:02,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:02,374 INFO L225 Difference]: With dead ends: 27913 [2022-12-13 20:21:02,374 INFO L226 Difference]: Without dead ends: 15879 [2022-12-13 20:21:02,382 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-12-13 20:21:02,382 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 45 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 165 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-12-13 20:21:02,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 165 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:02,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15879 states. [2022-12-13 20:21:02,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15879 to 15877. [2022-12-13 20:21:02,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15877 states, 15876 states have (on average 1.2740614764424287) internal successors, (20227), 15876 states have internal predecessors, (20227), 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-12-13 20:21:02,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15877 states to 15877 states and 20227 transitions. [2022-12-13 20:21:02,645 INFO L78 Accepts]: Start accepts. Automaton has 15877 states and 20227 transitions. Word has length 26 [2022-12-13 20:21:02,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:02,646 INFO L495 AbstractCegarLoop]: Abstraction has 15877 states and 20227 transitions. [2022-12-13 20:21:02,646 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-12-13 20:21:02,646 INFO L276 IsEmpty]: Start isEmpty. Operand 15877 states and 20227 transitions. [2022-12-13 20:21:02,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 20:21:02,655 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:02,655 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-12-13 20:21:02,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-12-13 20:21:02,655 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:02,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:02,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1076147793, now seen corresponding path program 1 times [2022-12-13 20:21:02,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:02,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195924744] [2022-12-13 20:21:02,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:02,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:02,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:02,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:02,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:02,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195924744] [2022-12-13 20:21:02,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195924744] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:02,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:02,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:02,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784920047] [2022-12-13 20:21:02,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:02,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:02,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:02,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:02,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:02,692 INFO L87 Difference]: Start difference. First operand 15877 states and 20227 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-12-13 20:21:02,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:02,934 INFO L93 Difference]: Finished difference Result 23817 states and 30213 transitions. [2022-12-13 20:21:02,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:02,935 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-12-13 20:21:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:02,955 INFO L225 Difference]: With dead ends: 23817 [2022-12-13 20:21:02,955 INFO L226 Difference]: Without dead ends: 16135 [2022-12-13 20:21:02,962 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-12-13 20:21:02,963 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 47 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 144 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-12-13 20:21:02,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 144 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:02,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16135 states. [2022-12-13 20:21:03,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16135 to 16133. [2022-12-13 20:21:03,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16133 states, 16132 states have (on average 1.2538432928341186) internal successors, (20227), 16132 states have internal predecessors, (20227), 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-12-13 20:21:03,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16133 states to 16133 states and 20227 transitions. [2022-12-13 20:21:03,314 INFO L78 Accepts]: Start accepts. Automaton has 16133 states and 20227 transitions. Word has length 27 [2022-12-13 20:21:03,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:03,314 INFO L495 AbstractCegarLoop]: Abstraction has 16133 states and 20227 transitions. [2022-12-13 20:21:03,314 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-12-13 20:21:03,314 INFO L276 IsEmpty]: Start isEmpty. Operand 16133 states and 20227 transitions. [2022-12-13 20:21:03,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 20:21:03,321 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:03,321 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-12-13 20:21:03,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-12-13 20:21:03,322 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:03,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:03,322 INFO L85 PathProgramCache]: Analyzing trace with hash -203715885, now seen corresponding path program 1 times [2022-12-13 20:21:03,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:03,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670564986] [2022-12-13 20:21:03,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:03,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:03,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:03,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670564986] [2022-12-13 20:21:03,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670564986] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:03,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:03,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:03,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964594530] [2022-12-13 20:21:03,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:03,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:03,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:03,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:03,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:03,336 INFO L87 Difference]: Start difference. First operand 16133 states and 20227 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-12-13 20:21:03,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:03,640 INFO L93 Difference]: Finished difference Result 26633 states and 33541 transitions. [2022-12-13 20:21:03,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:03,641 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-12-13 20:21:03,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:03,672 INFO L225 Difference]: With dead ends: 26633 [2022-12-13 20:21:03,672 INFO L226 Difference]: Without dead ends: 26631 [2022-12-13 20:21:03,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-12-13 20:21:03,675 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 121 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-12-13 20:21:03,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 121 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:03,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26631 states. [2022-12-13 20:21:03,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26631 to 24581. [2022-12-13 20:21:04,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24581 states, 24580 states have (on average 1.2186737184703011) internal successors, (29955), 24580 states have internal predecessors, (29955), 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-12-13 20:21:04,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24581 states to 24581 states and 29955 transitions. [2022-12-13 20:21:04,045 INFO L78 Accepts]: Start accepts. Automaton has 24581 states and 29955 transitions. Word has length 27 [2022-12-13 20:21:04,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:04,045 INFO L495 AbstractCegarLoop]: Abstraction has 24581 states and 29955 transitions. [2022-12-13 20:21:04,045 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-12-13 20:21:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 24581 states and 29955 transitions. [2022-12-13 20:21:04,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-12-13 20:21:04,067 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:04,067 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-12-13 20:21:04,067 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-12-13 20:21:04,067 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:04,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1214833135, now seen corresponding path program 1 times [2022-12-13 20:21:04,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:04,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110214834] [2022-12-13 20:21:04,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:04,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:04,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:04,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110214834] [2022-12-13 20:21:04,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110214834] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:04,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:04,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:04,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125757261] [2022-12-13 20:21:04,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:04,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:04,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:04,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:04,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:04,107 INFO L87 Difference]: Start difference. First operand 24581 states and 29955 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-12-13 20:21:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:04,451 INFO L93 Difference]: Finished difference Result 55305 states and 66821 transitions. [2022-12-13 20:21:04,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:04,452 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-12-13 20:21:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:04,481 INFO L225 Difference]: With dead ends: 55305 [2022-12-13 20:21:04,481 INFO L226 Difference]: Without dead ends: 31239 [2022-12-13 20:21:04,496 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-12-13 20:21:04,497 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 44 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 166 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-12-13 20:21:04,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 166 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:04,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31239 states. [2022-12-13 20:21:05,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31239 to 31237. [2022-12-13 20:21:05,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31237 states, 31236 states have (on average 1.1802727621974645) internal successors, (36867), 31236 states have internal predecessors, (36867), 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-12-13 20:21:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31237 states to 31237 states and 36867 transitions. [2022-12-13 20:21:05,259 INFO L78 Accepts]: Start accepts. Automaton has 31237 states and 36867 transitions. Word has length 27 [2022-12-13 20:21:05,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:05,259 INFO L495 AbstractCegarLoop]: Abstraction has 31237 states and 36867 transitions. [2022-12-13 20:21:05,259 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-12-13 20:21:05,259 INFO L276 IsEmpty]: Start isEmpty. Operand 31237 states and 36867 transitions. [2022-12-13 20:21:05,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 20:21:05,275 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:05,275 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-12-13 20:21:05,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-12-13 20:21:05,276 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:05,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:05,276 INFO L85 PathProgramCache]: Analyzing trace with hash -2020009046, now seen corresponding path program 1 times [2022-12-13 20:21:05,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:05,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102607778] [2022-12-13 20:21:05,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:05,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:05,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:05,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:05,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102607778] [2022-12-13 20:21:05,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102607778] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:05,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:05,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:05,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681527176] [2022-12-13 20:21:05,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:05,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:05,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:05,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:05,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:05,295 INFO L87 Difference]: Start difference. First operand 31237 states and 36867 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-12-13 20:21:05,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:05,749 INFO L93 Difference]: Finished difference Result 46857 states and 55045 transitions. [2022-12-13 20:21:05,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:05,749 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-12-13 20:21:05,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:05,773 INFO L225 Difference]: With dead ends: 46857 [2022-12-13 20:21:05,773 INFO L226 Difference]: Without dead ends: 31751 [2022-12-13 20:21:05,783 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-12-13 20:21:05,783 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 46 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 140 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-12-13 20:21:05,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 140 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:05,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31751 states. [2022-12-13 20:21:06,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31751 to 31749. [2022-12-13 20:21:06,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.1612385032128008) internal successors, (36867), 31748 states have internal predecessors, (36867), 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-12-13 20:21:06,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 36867 transitions. [2022-12-13 20:21:06,276 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 36867 transitions. Word has length 28 [2022-12-13 20:21:06,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:06,276 INFO L495 AbstractCegarLoop]: Abstraction has 31749 states and 36867 transitions. [2022-12-13 20:21:06,276 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-12-13 20:21:06,277 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 36867 transitions. [2022-12-13 20:21:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 20:21:06,288 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:06,288 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-12-13 20:21:06,289 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-12-13 20:21:06,289 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:06,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:06,289 INFO L85 PathProgramCache]: Analyzing trace with hash 995094572, now seen corresponding path program 1 times [2022-12-13 20:21:06,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:06,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330449579] [2022-12-13 20:21:06,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:06,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:06,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:06,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:06,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:06,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330449579] [2022-12-13 20:21:06,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330449579] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:06,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:06,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:06,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861795230] [2022-12-13 20:21:06,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:06,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:06,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:06,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:06,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:06,304 INFO L87 Difference]: Start difference. First operand 31749 states and 36867 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-12-13 20:21:06,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:06,865 INFO L93 Difference]: Finished difference Result 92167 states and 104452 transitions. [2022-12-13 20:21:06,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:06,865 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-12-13 20:21:06,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:06,889 INFO L225 Difference]: With dead ends: 92167 [2022-12-13 20:21:06,889 INFO L226 Difference]: Without dead ends: 31749 [2022-12-13 20:21:06,906 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-12-13 20:21:06,906 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 43 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 138 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-12-13 20:21:06,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 138 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:06,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31749 states. [2022-12-13 20:21:07,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31749 to 31749. [2022-12-13 20:21:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31749 states, 31748 states have (on average 1.096730502708832) internal successors, (34819), 31748 states have internal predecessors, (34819), 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-12-13 20:21:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31749 states to 31749 states and 34819 transitions. [2022-12-13 20:21:07,435 INFO L78 Accepts]: Start accepts. Automaton has 31749 states and 34819 transitions. Word has length 28 [2022-12-13 20:21:07,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:07,435 INFO L495 AbstractCegarLoop]: Abstraction has 31749 states and 34819 transitions. [2022-12-13 20:21:07,435 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-12-13 20:21:07,435 INFO L276 IsEmpty]: Start isEmpty. Operand 31749 states and 34819 transitions. [2022-12-13 20:21:07,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 20:21:07,445 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:21:07,445 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-12-13 20:21:07,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-12-13 20:21:07,445 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:21:07,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:21:07,445 INFO L85 PathProgramCache]: Analyzing trace with hash 2006211822, now seen corresponding path program 1 times [2022-12-13 20:21:07,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:21:07,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643350072] [2022-12-13 20:21:07,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:21:07,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:21:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:21:07,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:21:07,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:21:07,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643350072] [2022-12-13 20:21:07,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643350072] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:21:07,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:21:07,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 20:21:07,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54291457] [2022-12-13 20:21:07,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:21:07,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-12-13 20:21:07,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:21:07,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 20:21:07,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 20:21:07,460 INFO L87 Difference]: Start difference. First operand 31749 states and 34819 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-12-13 20:21:07,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:21:07,735 INFO L93 Difference]: Finished difference Result 31749 states and 34819 transitions. [2022-12-13 20:21:07,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 20:21:07,735 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-12-13 20:21:07,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:21:07,735 INFO L225 Difference]: With dead ends: 31749 [2022-12-13 20:21:07,735 INFO L226 Difference]: Without dead ends: 0 [2022-12-13 20:21:07,743 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-12-13 20:21:07,743 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:21:07,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 78 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:21:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-12-13 20:21:07,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-12-13 20:21:07,744 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-12-13 20:21:07,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-12-13 20:21:07,744 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 28 [2022-12-13 20:21:07,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:21:07,744 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-12-13 20:21:07,744 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-12-13 20:21:07,744 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-12-13 20:21:07,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-12-13 20:21:07,746 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-13 20:21:07,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-12-13 20:21:07,748 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-12-13 20:21:07,756 INFO L899 garLoopResultBuilder]: For program point L159-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,756 INFO L899 garLoopResultBuilder]: For program point L93-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,756 INFO L899 garLoopResultBuilder]: For program point L85-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,756 INFO L899 garLoopResultBuilder]: For program point L77-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,756 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 6 179) the Hoare annotation is: true [2022-12-13 20:21:07,756 INFO L899 garLoopResultBuilder]: For program point L135(line 135) no Hoare annotation was computed. [2022-12-13 20:21:07,756 INFO L899 garLoopResultBuilder]: For program point L160(line 160) no Hoare annotation was computed. [2022-12-13 20:21:07,756 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-12-13 20:21:07,756 INFO L899 garLoopResultBuilder]: For program point L119-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,756 INFO L899 garLoopResultBuilder]: For program point L144-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L902 garLoopResultBuilder]: At program point L169-1(lines 44 174) the Hoare annotation is: true [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L120(line 120) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L145(line 145) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 48) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L170(line 170) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L129-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L154-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L113-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L105-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L130(line 130) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L97-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L155(line 155) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L89-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L81-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L139-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L73(lines 73 75) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L73-2(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L164-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,757 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-12-13 20:21:07,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 177) no Hoare annotation was computed. [2022-12-13 20:21:07,758 INFO L899 garLoopResultBuilder]: For program point L140(line 140) no Hoare annotation was computed. [2022-12-13 20:21:07,758 INFO L899 garLoopResultBuilder]: For program point L165(line 165) no Hoare annotation was computed. [2022-12-13 20:21:07,758 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-12-13 20:21:07,758 INFO L899 garLoopResultBuilder]: For program point L124-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,758 INFO L899 garLoopResultBuilder]: For program point L149-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,758 INFO L899 garLoopResultBuilder]: For program point L125(line 125) no Hoare annotation was computed. [2022-12-13 20:21:07,758 INFO L895 garLoopResultBuilder]: At program point main_ERROR#1(lines 7 179) the Hoare annotation is: false [2022-12-13 20:21:07,758 INFO L899 garLoopResultBuilder]: For program point L150(line 150) no Hoare annotation was computed. [2022-12-13 20:21:07,758 INFO L902 garLoopResultBuilder]: At program point L175(lines 7 179) the Hoare annotation is: true [2022-12-13 20:21:07,758 INFO L899 garLoopResultBuilder]: For program point L109-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,758 INFO L899 garLoopResultBuilder]: For program point L134-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,758 INFO L899 garLoopResultBuilder]: For program point L101-1(lines 44 174) no Hoare annotation was computed. [2022-12-13 20:21:07,760 INFO L445 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] [2022-12-13 20:21:07,762 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-13 20:21:07,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.12 08:21:07 BoogieIcfgContainer [2022-12-13 20:21:07,768 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-13 20:21:07,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 20:21:07,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 20:21:07,768 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 20:21:07,769 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:20:58" (3/4) ... [2022-12-13 20:21:07,771 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-12-13 20:21:07,779 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-12-13 20:21:07,779 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-12-13 20:21:07,779 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-12-13 20:21:07,779 INFO L961 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-12-13 20:21:07,806 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 20:21:07,806 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 20:21:07,806 INFO L158 Benchmark]: Toolchain (without parser) took 9769.23ms. Allocated memory was 127.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 96.6MB in the beginning and 858.6MB in the end (delta: -762.0MB). Peak memory consumption was 715.4MB. Max. memory is 16.1GB. [2022-12-13 20:21:07,806 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 127.9MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:21:07,806 INFO L158 Benchmark]: CACSL2BoogieTranslator took 204.41ms. Allocated memory is still 127.9MB. Free memory was 96.2MB in the beginning and 85.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 20:21:07,806 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.42ms. Allocated memory is still 127.9MB. Free memory was 85.3MB in the beginning and 83.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 20:21:07,807 INFO L158 Benchmark]: Boogie Preprocessor took 20.27ms. Allocated memory is still 127.9MB. Free memory was 83.6MB in the beginning and 82.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 20:21:07,807 INFO L158 Benchmark]: RCFGBuilder took 263.95ms. Allocated memory is still 127.9MB. Free memory was 82.0MB in the beginning and 67.5MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-12-13 20:21:07,807 INFO L158 Benchmark]: TraceAbstraction took 9206.51ms. Allocated memory was 127.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 66.8MB in the beginning and 862.8MB in the end (delta: -796.0MB). Peak memory consumption was 679.7MB. Max. memory is 16.1GB. [2022-12-13 20:21:07,807 INFO L158 Benchmark]: Witness Printer took 37.66ms. Allocated memory is still 1.6GB. Free memory was 862.8MB in the beginning and 858.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-13 20:21:07,808 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.14ms. Allocated memory is still 127.9MB. Free memory is still 102.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 204.41ms. Allocated memory is still 127.9MB. Free memory was 96.2MB in the beginning and 85.3MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.42ms. Allocated memory is still 127.9MB. Free memory was 85.3MB in the beginning and 83.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.27ms. Allocated memory is still 127.9MB. Free memory was 83.6MB in the beginning and 82.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 263.95ms. Allocated memory is still 127.9MB. Free memory was 82.0MB in the beginning and 67.5MB in the end (delta: 14.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 9206.51ms. Allocated memory was 127.9MB in the beginning and 1.6GB in the end (delta: 1.5GB). Free memory was 66.8MB in the beginning and 862.8MB in the end (delta: -796.0MB). Peak memory consumption was 679.7MB. Max. memory is 16.1GB. * Witness Printer took 37.66ms. Allocated memory is still 1.6GB. Free memory was 862.8MB in the beginning and 858.6MB 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: 177]: 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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.2s, OverallIterations: 31, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1400 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1400 mSDsluCounter, 4588 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1835 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 163 IncrementalHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 2753 mSDtfsCounter, 163 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 93 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31749occurred in iteration=29, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 31 MinimizatonAttempts, 6176 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 2057 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 720 NumberOfCodeBlocks, 720 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 689 ConstructedInterpolants, 0 QuantifiedInterpolants, 1492 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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: 44]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-12-13 20:21:07,819 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_bce318a3-79f0-4e91-a307-a153e745b9a9/bin/uautomizer-uyxdKDjOR8/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