./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-10.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 24099d82b3ec494380587a5a92596aaf0762a1093bfe7e4cba5f9fda7da3acf4 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:03:05,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:03:05,969 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 05:03:05,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:03:05,974 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:03:05,996 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:03:05,996 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:03:05,997 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:03:05,997 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:03:05,998 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:03:05,998 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:03:05,999 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:03:06,000 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:03:06,000 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:03:06,001 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:03:06,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:03:06,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 05:03:06,002 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:03:06,003 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:03:06,004 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:03:06,004 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:03:06,005 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 05:03:06,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:03:06,006 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 05:03:06,006 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:03:06,007 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 05:03:06,007 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:03:06,008 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:03:06,008 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:03:06,008 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:03:06,009 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:03:06,009 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:03:06,009 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:03:06,010 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:03:06,010 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 05:03:06,010 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:03:06,010 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:03:06,010 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:03:06,011 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:03:06,011 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 05:03:06,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:03:06,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:03:06,011 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/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_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 24099d82b3ec494380587a5a92596aaf0762a1093bfe7e4cba5f9fda7da3acf4 [2023-11-29 05:03:06,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:03:06,258 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:03:06,261 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:03:06,262 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:03:06,262 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:03:06,263 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-10.i [2023-11-29 05:03:09,037 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:03:09,249 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:03:09,250 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-10.i [2023-11-29 05:03:09,260 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/data/e1fc771c6/580969b9fe3743ee9c179d2720c7b8cb/FLAGfbb6f9283 [2023-11-29 05:03:09,274 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/data/e1fc771c6/580969b9fe3743ee9c179d2720c7b8cb [2023-11-29 05:03:09,277 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:03:09,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:03:09,280 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:03:09,280 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:03:09,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:03:09,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,285 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6a9fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09, skipping insertion in model container [2023-11-29 05:03:09,285 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,312 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:03:09,429 WARN L240 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_1537be5c-8b9c-48f4-857a-a0327eef8f3c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-10.i[913,926] [2023-11-29 05:03:09,483 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:03:09,494 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:03:09,504 WARN L240 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_1537be5c-8b9c-48f4-857a-a0327eef8f3c/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_normal_file-10.i[913,926] [2023-11-29 05:03:09,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:03:09,546 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:03:09,547 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09 WrapperNode [2023-11-29 05:03:09,547 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:03:09,548 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:03:09,548 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:03:09,548 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:03:09,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,605 INFO L138 Inliner]: procedures = 26, calls = 31, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2023-11-29 05:03:09,606 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:03:09,607 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:03:09,607 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:03:09,607 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:03:09,616 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,616 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,620 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,641 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-11-29 05:03:09,641 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,641 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,655 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,659 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,662 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,665 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,671 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:03:09,672 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:03:09,672 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:03:09,672 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:03:09,673 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (1/1) ... [2023-11-29 05:03:09,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:03:09,691 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:03:09,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:03:09,721 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1537be5c-8b9c-48f4-857a-a0327eef8f3c/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:03:09,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:03:09,748 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 05:03:09,749 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 05:03:09,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:03:09,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:03:09,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:03:09,822 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:03:09,825 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:03:10,192 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:03:10,222 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:03:10,222 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 05:03:10,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:03:10 BoogieIcfgContainer [2023-11-29 05:03:10,223 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:03:10,226 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:03:10,226 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:03:10,229 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:03:10,229 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:03:09" (1/3) ... [2023-11-29 05:03:10,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e03995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:03:10, skipping insertion in model container [2023-11-29 05:03:10,230 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:03:09" (2/3) ... [2023-11-29 05:03:10,230 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e03995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:03:10, skipping insertion in model container [2023-11-29 05:03:10,231 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:03:10" (3/3) ... [2023-11-29 05:03:10,232 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_normal_file-10.i [2023-11-29 05:03:10,248 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:03:10,249 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 05:03:10,293 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:03:10,299 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@57d86573, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:03:10,300 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 05:03:10,303 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 05:03:10,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 05:03:10,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:10,318 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:10,319 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:03:10,323 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:10,324 INFO L85 PathProgramCache]: Analyzing trace with hash -379473606, now seen corresponding path program 1 times [2023-11-29 05:03:10,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:03:10,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161984659] [2023-11-29 05:03:10,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:10,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:03:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:03:10,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:03:10,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:03:10,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:03:10,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:03:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:03:10,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:03:10,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:03:10,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:03:10,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:03:10,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:03:10,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:03:10,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:03:10,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:03:10,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:03:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:03:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:03:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:03:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:10,721 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:03:10,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:03:10,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161984659] [2023-11-29 05:03:10,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161984659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:03:10,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:03:10,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:03:10,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30997828] [2023-11-29 05:03:10,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:03:10,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 05:03:10,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:03:10,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 05:03:10,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:03:10,766 INFO L87 Difference]: Start difference. First operand has 64 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 05:03:10,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:03:10,807 INFO L93 Difference]: Finished difference Result 125 states and 216 transitions. [2023-11-29 05:03:10,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 05:03:10,810 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 118 [2023-11-29 05:03:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:03:10,819 INFO L225 Difference]: With dead ends: 125 [2023-11-29 05:03:10,820 INFO L226 Difference]: Without dead ends: 62 [2023-11-29 05:03:10,823 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 05:03:10,827 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:03:10,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 92 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 05:03:10,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-29 05:03:10,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2023-11-29 05:03:10,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-29 05:03:10,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 95 transitions. [2023-11-29 05:03:10,880 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 95 transitions. Word has length 118 [2023-11-29 05:03:10,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:03:10,881 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 95 transitions. [2023-11-29 05:03:10,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 05:03:10,882 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 95 transitions. [2023-11-29 05:03:10,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2023-11-29 05:03:10,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:10,886 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:10,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:03:10,886 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:03:10,887 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:10,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1308844666, now seen corresponding path program 1 times [2023-11-29 05:03:10,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:03:10,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718805667] [2023-11-29 05:03:10,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:10,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:03:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:03:11,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:03:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:03:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:03:11,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:03:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:03:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:03:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:03:11,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:03:11,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:03:11,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:03:11,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:03:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:03:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:03:11,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:03:11,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:03:11,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:03:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:03:11,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:11,391 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:03:11,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:03:11,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718805667] [2023-11-29 05:03:11,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718805667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:03:11,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:03:11,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:03:11,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410092237] [2023-11-29 05:03:11,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:03:11,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:03:11,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:03:11,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:03:11,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:03:11,397 INFO L87 Difference]: Start difference. First operand 62 states and 95 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:03:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:03:11,577 INFO L93 Difference]: Finished difference Result 185 states and 284 transitions. [2023-11-29 05:03:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:03:11,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 118 [2023-11-29 05:03:11,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:03:11,581 INFO L225 Difference]: With dead ends: 185 [2023-11-29 05:03:11,581 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 05:03:11,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 05:03:11,584 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 92 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:03:11,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 351 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 05:03:11,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 05:03:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 95. [2023-11-29 05:03:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 56 states have (on average 1.3035714285714286) internal successors, (73), 56 states have internal predecessors, (73), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 05:03:11,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 145 transitions. [2023-11-29 05:03:11,610 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 145 transitions. Word has length 118 [2023-11-29 05:03:11,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:03:11,611 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 145 transitions. [2023-11-29 05:03:11,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:03:11,611 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 145 transitions. [2023-11-29 05:03:11,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 05:03:11,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:11,614 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:11,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:03:11,614 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:03:11,615 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:11,615 INFO L85 PathProgramCache]: Analyzing trace with hash -582534747, now seen corresponding path program 1 times [2023-11-29 05:03:11,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:03:11,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557832366] [2023-11-29 05:03:11,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:11,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:03:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:03:20,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:03:20,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:03:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:03:20,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:03:20,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:03:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:03:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:03:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:03:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:03:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:03:20,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:03:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:03:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:03:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:03:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:03:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:03:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:03:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:03:20,080 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:03:20,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:03:20,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557832366] [2023-11-29 05:03:20,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557832366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:03:20,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:03:20,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:03:20,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630128750] [2023-11-29 05:03:20,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:03:20,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:03:20,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:03:20,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:03:20,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:03:20,083 INFO L87 Difference]: Start difference. First operand 95 states and 145 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:03:21,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:03:21,625 INFO L93 Difference]: Finished difference Result 287 states and 425 transitions. [2023-11-29 05:03:21,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 05:03:21,626 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 05:03:21,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:03:21,629 INFO L225 Difference]: With dead ends: 287 [2023-11-29 05:03:21,629 INFO L226 Difference]: Without dead ends: 226 [2023-11-29 05:03:21,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=156, Invalid=396, Unknown=0, NotChecked=0, Total=552 [2023-11-29 05:03:21,632 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 259 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 05:03:21,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 443 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 05:03:21,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2023-11-29 05:03:21,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 111. [2023-11-29 05:03:21,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.3611111111111112) internal successors, (98), 72 states have internal predecessors, (98), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 05:03:21,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 170 transitions. [2023-11-29 05:03:21,657 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 170 transitions. Word has length 119 [2023-11-29 05:03:21,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:03:21,658 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 170 transitions. [2023-11-29 05:03:21,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:03:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 170 transitions. [2023-11-29 05:03:21,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 05:03:21,660 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:03:21,661 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:03:21,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:03:21,661 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:03:21,661 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:03:21,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1391881373, now seen corresponding path program 1 times [2023-11-29 05:03:21,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:03:21,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183840448] [2023-11-29 05:03:21,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:03:21,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:03:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:00,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:05:00,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:00,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:05:00,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:00,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:05:00,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:00,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:05:00,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:00,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:05:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:00,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:05:00,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:00,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:05:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:00,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:05:00,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:00,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:05:00,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:05:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:01,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:05:01,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:01,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:05:01,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:01,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:05:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:01,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:05:01,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:01,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:05:01,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:01,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:05:01,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:01,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:05:01,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:01,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:05:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:05:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:05:01,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:05:01,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183840448] [2023-11-29 05:05:01,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183840448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:05:01,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:05:01,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 05:05:01,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162888399] [2023-11-29 05:05:01,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:05:01,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:05:01,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:05:01,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:05:01,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:05:01,029 INFO L87 Difference]: Start difference. First operand 111 states and 170 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:05:04,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:05:04,514 INFO L93 Difference]: Finished difference Result 292 states and 435 transitions. [2023-11-29 05:05:04,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 05:05:04,514 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 05:05:04,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:05:04,518 INFO L225 Difference]: With dead ends: 292 [2023-11-29 05:05:04,518 INFO L226 Difference]: Without dead ends: 231 [2023-11-29 05:05:04,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2023-11-29 05:05:04,521 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 353 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 509 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:05:04,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 459 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-29 05:05:04,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-11-29 05:05:04,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 125. [2023-11-29 05:05:04,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 86 states have (on average 1.3953488372093024) internal successors, (120), 86 states have internal predecessors, (120), 36 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2023-11-29 05:05:04,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 192 transitions. [2023-11-29 05:05:04,548 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 192 transitions. Word has length 119 [2023-11-29 05:05:04,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:05:04,549 INFO L495 AbstractCegarLoop]: Abstraction has 125 states and 192 transitions. [2023-11-29 05:05:04,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:05:04,549 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 192 transitions. [2023-11-29 05:05:04,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 05:05:04,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:05:04,552 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:05:04,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:05:04,552 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:05:04,553 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:05:04,553 INFO L85 PathProgramCache]: Analyzing trace with hash -65381723, now seen corresponding path program 1 times [2023-11-29 05:05:04,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:05:04,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453943330] [2023-11-29 05:05:04,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:05:04,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:05:04,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:07:44,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:07:44,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:07:44,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:07:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:07:44,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:07:44,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:07:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:07:44,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:07:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:07:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:07:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:07:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:07:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:07:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:07:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:07:44,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:07:44,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:07:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:44,303 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:07:44,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:44,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453943330] [2023-11-29 05:07:44,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453943330] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:44,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:44,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 05:07:44,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855089062] [2023-11-29 05:07:44,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:44,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:07:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:44,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:07:44,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:07:44,307 INFO L87 Difference]: Start difference. First operand 125 states and 192 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 05:07:48,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:07:54,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:07:57,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:07:57,655 INFO L93 Difference]: Finished difference Result 349 states and 517 transitions. [2023-11-29 05:07:57,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 05:07:57,655 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2023-11-29 05:07:57,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:07:57,658 INFO L225 Difference]: With dead ends: 349 [2023-11-29 05:07:57,658 INFO L226 Difference]: Without dead ends: 281 [2023-11-29 05:07:57,659 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2023-11-29 05:07:57,661 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 445 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 87 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 445 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 716 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:07:57,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [445 Valid, 431 Invalid, 716 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 628 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2023-11-29 05:07:57,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2023-11-29 05:07:57,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 209. [2023-11-29 05:07:57,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 148 states have (on average 1.3581081081081081) internal successors, (201), 148 states have internal predecessors, (201), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 05:07:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 309 transitions. [2023-11-29 05:07:57,690 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 309 transitions. Word has length 119 [2023-11-29 05:07:57,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:07:57,691 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 309 transitions. [2023-11-29 05:07:57,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 05:07:57,691 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 309 transitions. [2023-11-29 05:07:57,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 05:07:57,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:07:57,693 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:57,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:07:57,694 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:07:57,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:57,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1623222245, now seen corresponding path program 1 times [2023-11-29 05:07:57,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:57,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760073643] [2023-11-29 05:07:57,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:57,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:08:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:08:54,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:08:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:08:54,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:08:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:08:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:08:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:08:54,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:08:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:08:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:08:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:08:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:08:54,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:08:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:08:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:08:54,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:08:54,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:08:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:08:54,340 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:08:54,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:08:54,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760073643] [2023-11-29 05:08:54,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760073643] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:08:54,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:08:54,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:08:54,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013223058] [2023-11-29 05:08:54,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:08:54,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:08:54,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:08:54,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:08:54,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:08:54,342 INFO L87 Difference]: Start difference. First operand 209 states and 309 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:09:01,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:09:01,065 INFO L93 Difference]: Finished difference Result 421 states and 616 transitions. [2023-11-29 05:09:01,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 05:09:01,065 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 05:09:01,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:09:01,068 INFO L225 Difference]: With dead ends: 421 [2023-11-29 05:09:01,068 INFO L226 Difference]: Without dead ends: 279 [2023-11-29 05:09:01,069 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=175, Invalid=425, Unknown=0, NotChecked=0, Total=600 [2023-11-29 05:09:01,070 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 220 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 564 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:09:01,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 521 Invalid, 564 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 05:09:01,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-29 05:09:01,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 211. [2023-11-29 05:09:01,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 150 states have (on average 1.3533333333333333) internal successors, (203), 150 states have internal predecessors, (203), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 05:09:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2023-11-29 05:09:01,097 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 119 [2023-11-29 05:09:01,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:09:01,098 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2023-11-29 05:09:01,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:09:01,098 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2023-11-29 05:09:01,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 05:09:01,100 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:09:01,100 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:09:01,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:09:01,100 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:09:01,101 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:01,101 INFO L85 PathProgramCache]: Analyzing trace with hash 2124084647, now seen corresponding path program 1 times [2023-11-29 05:09:01,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:01,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75974834] [2023-11-29 05:09:01,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:01,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:01,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:09:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:09:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:09:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:09:22,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:09:22,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:09:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:09:22,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:09:22,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:09:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:09:22,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:09:22,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:09:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:09:22,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:09:22,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:09:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:09:22,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:09:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:09:22,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:09:22,865 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:09:22,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:09:22,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75974834] [2023-11-29 05:09:22,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75974834] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:09:22,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:09:22,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 05:09:22,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886589969] [2023-11-29 05:09:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:09:22,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:09:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:09:22,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:09:22,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:09:22,867 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 05:09:25,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:09:25,566 INFO L93 Difference]: Finished difference Result 403 states and 592 transitions. [2023-11-29 05:09:25,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 05:09:25,567 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2023-11-29 05:09:25,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:09:25,569 INFO L225 Difference]: With dead ends: 403 [2023-11-29 05:09:25,569 INFO L226 Difference]: Without dead ends: 342 [2023-11-29 05:09:25,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2023-11-29 05:09:25,570 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 592 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 05:09:25,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [592 Valid, 508 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 05:09:25,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-11-29 05:09:25,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 288. [2023-11-29 05:09:25,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 206 states have (on average 1.354368932038835) internal successors, (279), 206 states have internal predecessors, (279), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-29 05:09:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 423 transitions. [2023-11-29 05:09:25,602 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 423 transitions. Word has length 119 [2023-11-29 05:09:25,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:09:25,603 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 423 transitions. [2023-11-29 05:09:25,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 05:09:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 423 transitions. [2023-11-29 05:09:25,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 05:09:25,604 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:09:25,605 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:09:25,605 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:09:25,605 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:09:25,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:09:25,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1314738021, now seen corresponding path program 1 times [2023-11-29 05:09:25,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:09:25,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920501412] [2023-11-29 05:09:25,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:09:25,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:09:25,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:39,953 WARN L293 SmtUtils]: Spent 6.43s on a formula simplification. DAG size of input: 214 DAG size of output: 188 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:12:39,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:12:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:39,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:12:39,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:39,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:12:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:39,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:12:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:39,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:12:39,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:39,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:12:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:12:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:39,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:12:40,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:12:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:40,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:12:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:40,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:12:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:40,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:12:40,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:40,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:12:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:40,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:12:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:40,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:12:40,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:40,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:12:40,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:40,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:12:40,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:40,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:12:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:12:40,028 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:12:40,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:12:40,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920501412] [2023-11-29 05:12:40,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [920501412] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:12:40,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:12:40,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 05:12:40,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093470450] [2023-11-29 05:12:40,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:12:40,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 05:12:40,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:12:40,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 05:12:40,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-29 05:12:40,031 INFO L87 Difference]: Start difference. First operand 288 states and 423 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:12:44,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:12:49,785 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:12:50,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:12:50,701 INFO L93 Difference]: Finished difference Result 570 states and 829 transitions. [2023-11-29 05:12:50,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 05:12:50,702 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 05:12:50,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:12:50,705 INFO L225 Difference]: With dead ends: 570 [2023-11-29 05:12:50,705 INFO L226 Difference]: Without dead ends: 509 [2023-11-29 05:12:50,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=201, Invalid=611, Unknown=0, NotChecked=0, Total=812 [2023-11-29 05:12:50,706 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 378 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 64 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2023-11-29 05:12:50,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 572 Invalid, 725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 660 Invalid, 1 Unknown, 0 Unchecked, 7.1s Time] [2023-11-29 05:12:50,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2023-11-29 05:12:50,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 363. [2023-11-29 05:12:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 260 states have (on average 1.353846153846154) internal successors, (352), 260 states have internal predecessors, (352), 90 states have call successors, (90), 12 states have call predecessors, (90), 12 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2023-11-29 05:12:50,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 532 transitions. [2023-11-29 05:12:50,739 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 532 transitions. Word has length 119 [2023-11-29 05:12:50,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:12:50,739 INFO L495 AbstractCegarLoop]: Abstraction has 363 states and 532 transitions. [2023-11-29 05:12:50,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:12:50,740 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 532 transitions. [2023-11-29 05:12:50,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 05:12:50,741 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:12:50,741 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:12:50,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:12:50,742 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:12:50,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:12:50,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1653729625, now seen corresponding path program 1 times [2023-11-29 05:12:50,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:12:50,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080556655] [2023-11-29 05:12:50,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:12:50,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:12:50,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:15:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:15:48,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:15:48,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:15:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:15:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:15:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:15:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:15:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:15:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:15:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:15:48,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:15:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:15:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:15:48,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:15:48,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:15:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:15:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:15:48,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:15:48,787 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:15:48,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:15:48,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080556655] [2023-11-29 05:15:48,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080556655] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:15:48,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:15:48,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 05:15:48,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098030590] [2023-11-29 05:15:48,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:15:48,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 05:15:48,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:15:48,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 05:15:48,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2023-11-29 05:15:48,789 INFO L87 Difference]: Start difference. First operand 363 states and 532 transitions. Second operand has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 05:15:51,903 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.43s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:16:01,200 WARN L293 SmtUtils]: Spent 8.48s on a formula simplification. DAG size of input: 208 DAG size of output: 190 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:16:08,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:16:18,395 WARN L293 SmtUtils]: Spent 9.28s on a formula simplification. DAG size of input: 204 DAG size of output: 186 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 05:16:18,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:18,772 INFO L93 Difference]: Finished difference Result 455 states and 666 transitions. [2023-11-29 05:16:18,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:16:18,772 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2023-11-29 05:16:18,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:18,775 INFO L225 Difference]: With dead ends: 455 [2023-11-29 05:16:18,775 INFO L226 Difference]: Without dead ends: 394 [2023-11-29 05:16:18,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2023-11-29 05:16:18,776 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 554 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 113 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:18,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 368 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 643 Invalid, 1 Unknown, 0 Unchecked, 8.2s Time] [2023-11-29 05:16:18,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2023-11-29 05:16:18,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 278. [2023-11-29 05:16:18,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 196 states have (on average 1.3418367346938775) internal successors, (263), 196 states have internal predecessors, (263), 72 states have call successors, (72), 9 states have call predecessors, (72), 9 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2023-11-29 05:16:18,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 407 transitions. [2023-11-29 05:16:18,802 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 407 transitions. Word has length 119 [2023-11-29 05:16:18,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:18,802 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 407 transitions. [2023-11-29 05:16:18,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 05:16:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 407 transitions. [2023-11-29 05:16:18,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-29 05:16:18,803 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:18,804 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:16:18,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:16:18,804 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:18,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:18,804 INFO L85 PathProgramCache]: Analyzing trace with hash 34874343, now seen corresponding path program 1 times [2023-11-29 05:16:18,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:18,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833559565] [2023-11-29 05:16:18,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:18,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:18,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:16:25,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:16:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:16:25,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:16:25,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:16:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:16:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:16:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:16:25,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:16:25,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:16:25,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:16:25,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:16:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:16:25,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:16:25,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:16:25,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:16:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:16:25,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:16:25,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:16:25,647 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:16:25,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:16:25,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833559565] [2023-11-29 05:16:25,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833559565] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:16:25,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:16:25,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 05:16:25,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939832259] [2023-11-29 05:16:25,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:16:25,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 05:16:25,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:16:25,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 05:16:25,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2023-11-29 05:16:25,648 INFO L87 Difference]: Start difference. First operand 278 states and 407 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:16:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:16:26,856 INFO L93 Difference]: Finished difference Result 458 states and 668 transitions. [2023-11-29 05:16:26,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:16:26,857 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2023-11-29 05:16:26,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:16:26,859 INFO L225 Difference]: With dead ends: 458 [2023-11-29 05:16:26,859 INFO L226 Difference]: Without dead ends: 316 [2023-11-29 05:16:26,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=189, Unknown=0, NotChecked=0, Total=306 [2023-11-29 05:16:26,860 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 159 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 05:16:26,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 443 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 05:16:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2023-11-29 05:16:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 211. [2023-11-29 05:16:26,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 150 states have (on average 1.3533333333333333) internal successors, (203), 150 states have internal predecessors, (203), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 05:16:26,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 311 transitions. [2023-11-29 05:16:26,878 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 311 transitions. Word has length 119 [2023-11-29 05:16:26,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:16:26,879 INFO L495 AbstractCegarLoop]: Abstraction has 211 states and 311 transitions. [2023-11-29 05:16:26,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 05:16:26,879 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 311 transitions. [2023-11-29 05:16:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 05:16:26,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:16:26,880 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:16:26,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:16:26,881 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:16:26,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:16:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash 385622693, now seen corresponding path program 1 times [2023-11-29 05:16:26,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:16:26,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996051142] [2023-11-29 05:16:26,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:16:26,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:16:26,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 05:17:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 05:17:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 05:17:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 05:17:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 05:17:05,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 05:17:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 05:17:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 05:17:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 05:17:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 05:17:05,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 05:17:05,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 05:17:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 05:17:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 05:17:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 05:17:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 05:17:05,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 05:17:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 05:17:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:17:05,681 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2023-11-29 05:17:05,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:17:05,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996051142] [2023-11-29 05:17:05,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996051142] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:17:05,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:17:05,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 05:17:05,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046324609] [2023-11-29 05:17:05,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:17:05,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 05:17:05,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:17:05,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 05:17:05,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2023-11-29 05:17:05,682 INFO L87 Difference]: Start difference. First operand 211 states and 311 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 05:17:10,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 05:17:14,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 05:17:14,601 INFO L93 Difference]: Finished difference Result 479 states and 687 transitions. [2023-11-29 05:17:14,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-29 05:17:14,602 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 120 [2023-11-29 05:17:14,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 05:17:14,605 INFO L225 Difference]: With dead ends: 479 [2023-11-29 05:17:14,605 INFO L226 Difference]: Without dead ends: 418 [2023-11-29 05:17:14,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=274, Invalid=848, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 05:17:14,606 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 807 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 807 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-11-29 05:17:14,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [807 Valid, 504 Invalid, 729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2023-11-29 05:17:14,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2023-11-29 05:17:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 217. [2023-11-29 05:17:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 156 states have (on average 1.358974358974359) internal successors, (212), 156 states have internal predecessors, (212), 54 states have call successors, (54), 6 states have call predecessors, (54), 6 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 05:17:14,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 320 transitions. [2023-11-29 05:17:14,629 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 320 transitions. Word has length 120 [2023-11-29 05:17:14,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 05:17:14,629 INFO L495 AbstractCegarLoop]: Abstraction has 217 states and 320 transitions. [2023-11-29 05:17:14,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 14 states have internal predecessors, (33), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 05:17:14,630 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 320 transitions. [2023-11-29 05:17:14,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 05:17:14,631 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 05:17:14,631 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:17:14,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:17:14,631 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 05:17:14,632 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:17:14,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1065681063, now seen corresponding path program 1 times [2023-11-29 05:17:14,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:17:14,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548037413] [2023-11-29 05:17:14,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:17:14,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:17:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat