./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_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_1bb826d9-0b94-4392-871f-2500b16acaf8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb826d9-0b94-4392-871f-2500b16acaf8/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_1bb826d9-0b94-4392-871f-2500b16acaf8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb826d9-0b94-4392-871f-2500b16acaf8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-10.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb826d9-0b94-4392-871f-2500b16acaf8/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_1bb826d9-0b94-4392-871f-2500b16acaf8/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 0ccee0229556691a937cdcac01dc95204eb56d830547417b519006af3a6e2b5c --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:33:11,350 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:33:11,419 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb826d9-0b94-4392-871f-2500b16acaf8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:33:11,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:33:11,424 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:33:11,449 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:33:11,449 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:33:11,450 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:33:11,450 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:33:11,451 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:33:11,451 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:33:11,452 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:33:11,453 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:33:11,453 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:33:11,454 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:33:11,455 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:33:11,455 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:33:11,456 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:33:11,456 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:33:11,457 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:33:11,457 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:33:11,458 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:33:11,459 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:33:11,459 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:33:11,460 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:33:11,460 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:33:11,461 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:33:11,461 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:33:11,462 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:33:11,462 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:33:11,463 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:33:11,463 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:33:11,464 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:33:11,464 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:33:11,465 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:33:11,465 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:33:11,465 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:33:11,465 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:33:11,466 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:33:11,466 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:33:11,466 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:33:11,466 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:33:11,467 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_1bb826d9-0b94-4392-871f-2500b16acaf8/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_1bb826d9-0b94-4392-871f-2500b16acaf8/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 -> 0ccee0229556691a937cdcac01dc95204eb56d830547417b519006af3a6e2b5c [2023-11-29 04:33:11,719 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:33:11,742 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:33:11,745 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:33:11,746 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:33:11,746 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:33:11,747 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb826d9-0b94-4392-871f-2500b16acaf8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-10.i [2023-11-29 04:33:14,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:33:14,852 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:33:14,853 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb826d9-0b94-4392-871f-2500b16acaf8/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-10.i [2023-11-29 04:33:14,860 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb826d9-0b94-4392-871f-2500b16acaf8/bin/uautomizer-verify-BQ2R08f2Ya/data/72b9aae9a/5619137a858c4920b8c7a807c6aef696/FLAGfbb750880 [2023-11-29 04:33:14,873 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb826d9-0b94-4392-871f-2500b16acaf8/bin/uautomizer-verify-BQ2R08f2Ya/data/72b9aae9a/5619137a858c4920b8c7a807c6aef696 [2023-11-29 04:33:14,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:33:14,877 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:33:14,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:33:14,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:33:14,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:33:14,883 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:33:14" (1/1) ... [2023-11-29 04:33:14,884 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3745a66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:14, skipping insertion in model container [2023-11-29 04:33:14,884 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:33:14" (1/1) ... [2023-11-29 04:33:14,914 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:33:15,048 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_1bb826d9-0b94-4392-871f-2500b16acaf8/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-10.i[913,926] [2023-11-29 04:33:15,114 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:33:15,127 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:33:15,138 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_1bb826d9-0b94-4392-871f-2500b16acaf8/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_normal_file-10.i[913,926] [2023-11-29 04:33:15,173 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:33:15,192 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:33:15,193 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15 WrapperNode [2023-11-29 04:33:15,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:33:15,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:33:15,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:33:15,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:33:15,201 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (1/1) ... [2023-11-29 04:33:15,214 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (1/1) ... [2023-11-29 04:33:15,264 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2023-11-29 04:33:15,264 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:33:15,265 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:33:15,265 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:33:15,265 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:33:15,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (1/1) ... [2023-11-29 04:33:15,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (1/1) ... [2023-11-29 04:33:15,278 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (1/1) ... [2023-11-29 04:33:15,301 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 04:33:15,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (1/1) ... [2023-11-29 04:33:15,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (1/1) ... [2023-11-29 04:33:15,316 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (1/1) ... [2023-11-29 04:33:15,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (1/1) ... [2023-11-29 04:33:15,324 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (1/1) ... [2023-11-29 04:33:15,327 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (1/1) ... [2023-11-29 04:33:15,332 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:33:15,333 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:33:15,333 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:33:15,333 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:33:15,334 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (1/1) ... [2023-11-29 04:33:15,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:33:15,349 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb826d9-0b94-4392-871f-2500b16acaf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:33:15,362 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb826d9-0b94-4392-871f-2500b16acaf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:33:15,367 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1bb826d9-0b94-4392-871f-2500b16acaf8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:33:15,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:33:15,406 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:33:15,406 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:33:15,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:33:15,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:33:15,407 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:33:15,498 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:33:15,501 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:33:15,888 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:33:15,925 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:33:15,925 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:33:15,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:33:15 BoogieIcfgContainer [2023-11-29 04:33:15,926 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:33:15,929 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:33:15,930 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:33:15,934 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:33:15,934 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:33:14" (1/3) ... [2023-11-29 04:33:15,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb24d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:33:15, skipping insertion in model container [2023-11-29 04:33:15,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:33:15" (2/3) ... [2023-11-29 04:33:15,935 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4eb24d62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:33:15, skipping insertion in model container [2023-11-29 04:33:15,936 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:33:15" (3/3) ... [2023-11-29 04:33:15,937 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_normal_file-10.i [2023-11-29 04:33:15,957 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:33:15,957 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:33:16,003 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:33:16,009 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;@29974d1f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:33:16,009 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:33:16,013 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 04:33:16,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 04:33:16,030 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:33:16,031 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:16,032 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:33:16,036 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:33:16,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2064335181, now seen corresponding path program 1 times [2023-11-29 04:33:16,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:33:16,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667399664] [2023-11-29 04:33:16,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:33:16,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:33:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:33:16,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:33:16,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:33:16,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:33:16,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:33:16,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:33:16,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:33:16,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:33:16,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:33:16,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:33:16,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:33:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:33:16,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:33:16,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:33:16,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:33:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:33:16,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:33:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:33:16,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:33:16,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:33:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 04:33:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:33:16,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 04:33:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 04:33:16,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:33:16,492 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 04:33:16,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:33:16,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667399664] [2023-11-29 04:33:16,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667399664] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:33:16,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:33:16,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:33:16,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90476617] [2023-11-29 04:33:16,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:33:16,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:33:16,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:33:16,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:33:16,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:33:16,537 INFO L87 Difference]: Start difference. First operand has 70 states, 43 states have (on average 1.4883720930232558) internal successors, (64), 44 states have internal predecessors, (64), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 04:33:16,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:33:16,577 INFO L93 Difference]: Finished difference Result 137 states and 246 transitions. [2023-11-29 04:33:16,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:33:16,580 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 148 [2023-11-29 04:33:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:33:16,590 INFO L225 Difference]: With dead ends: 137 [2023-11-29 04:33:16,590 INFO L226 Difference]: Without dead ends: 68 [2023-11-29 04:33:16,595 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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 04:33:16,599 INFO L413 NwaCegarLoop]: 104 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, 104 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 04:33:16,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:33:16,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-29 04:33:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2023-11-29 04:33:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 42 states have (on average 1.4047619047619047) internal successors, (59), 42 states have internal predecessors, (59), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 04:33:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 107 transitions. [2023-11-29 04:33:16,643 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 107 transitions. Word has length 148 [2023-11-29 04:33:16,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:33:16,644 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 107 transitions. [2023-11-29 04:33:16,644 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, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 04:33:16,644 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 107 transitions. [2023-11-29 04:33:16,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 04:33:16,649 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:33:16,649 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:16,649 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:33:16,649 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:33:16,650 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:33:16,650 INFO L85 PathProgramCache]: Analyzing trace with hash -898174643, now seen corresponding path program 1 times [2023-11-29 04:33:16,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:33:16,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427416336] [2023-11-29 04:33:16,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:33:16,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:33:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:35:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:35:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:35:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:35:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:35:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:35:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:35:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:35:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:35:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:35:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:35:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:35:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:35:02,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:35:02,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:35:02,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:35:02,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:35:02,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:35:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:35:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:35:02,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 04:35:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:35:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 04:35:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 04:35:02,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:35:02,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 04:35:02,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:35:02,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427416336] [2023-11-29 04:35:02,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427416336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:35:02,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:35:02,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:35:02,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747048638] [2023-11-29 04:35:02,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:35:02,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:35:02,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:35:02,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:35:02,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:35:02,612 INFO L87 Difference]: Start difference. First operand 68 states and 107 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 04:35:07,081 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 04:35:11,137 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 04:35:19,291 WARN L293 SmtUtils]: Spent 7.21s on a formula simplification that was a NOOP. DAG size: 163 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:35:23,339 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 04:35:29,153 WARN L293 SmtUtils]: Spent 5.45s on a formula simplification that was a NOOP. DAG size: 127 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:35:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:35:31,486 INFO L93 Difference]: Finished difference Result 203 states and 318 transitions. [2023-11-29 04:35:31,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:35:31,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 148 [2023-11-29 04:35:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:35:31,492 INFO L225 Difference]: With dead ends: 203 [2023-11-29 04:35:31,492 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 04:35:31,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:35:31,495 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 170 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 5 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.9s IncrementalHoareTripleChecker+Time [2023-11-29 04:35:31,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 303 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 208 Invalid, 3 Unknown, 0 Unchecked, 14.9s Time] [2023-11-29 04:35:31,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 04:35:31,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 88. [2023-11-29 04:35:31,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.4838709677419355) internal successors, (92), 62 states have internal predecessors, (92), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 04:35:31,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 140 transitions. [2023-11-29 04:35:31,515 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 140 transitions. Word has length 148 [2023-11-29 04:35:31,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:35:31,518 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 140 transitions. [2023-11-29 04:35:31,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 04:35:31,518 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 140 transitions. [2023-11-29 04:35:31,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2023-11-29 04:35:31,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:35:31,522 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:35:31,522 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:35:31,523 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:35:31,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:35:31,523 INFO L85 PathProgramCache]: Analyzing trace with hash -1599239221, now seen corresponding path program 1 times [2023-11-29 04:35:31,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:35:31,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730328279] [2023-11-29 04:35:31,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:35:31,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:35:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:39:06,330 WARN L293 SmtUtils]: Spent 19.05s on a formula simplification. DAG size of input: 253 DAG size of output: 252 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:42:15,502 WARN L293 SmtUtils]: Spent 17.39s on a formula simplification. DAG size of input: 285 DAG size of output: 284 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:45:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:45:12,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:45:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:45:12,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:45:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:45:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:45:12,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:45:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:45:12,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:45:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:45:12,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:45:12,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:45:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:45:12,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:45:12,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:45:12,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:45:12,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:45:12,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:45:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:45:12,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:45:12,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2023-11-29 04:45:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2023-11-29 04:45:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 04:45:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 04:45:12,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:45:12,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-11-29 04:45:12,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:45:12,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730328279] [2023-11-29 04:45:12,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730328279] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:45:12,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:45:12,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 04:45:12,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474430077] [2023-11-29 04:45:12,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:45:12,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:45:12,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:45:12,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:45:12,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:45:12,270 INFO L87 Difference]: Start difference. First operand 88 states and 140 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 04:45:16,969 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 04:45:22,223 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 04:45:56,982 WARN L293 SmtUtils]: Spent 32.59s on a formula simplification that was a NOOP. DAG size: 285 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:46:01,034 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 04:46:05,105 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:46:09,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-11-29 04:46:10,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:46:10,655 INFO L93 Difference]: Finished difference Result 212 states and 334 transitions. [2023-11-29 04:46:10,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:46:10,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 148 [2023-11-29 04:46:10,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:46:10,660 INFO L225 Difference]: With dead ends: 212 [2023-11-29 04:46:10,661 INFO L226 Difference]: Without dead ends: 125 [2023-11-29 04:46:10,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 73.2s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:46:10,663 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 126 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 4 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:46:10,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 296 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 176 Invalid, 5 Unknown, 0 Unchecked, 23.0s Time] [2023-11-29 04:46:10,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2023-11-29 04:46:10,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 90. [2023-11-29 04:46:10,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 64 states have (on average 1.5) internal successors, (96), 64 states have internal predecessors, (96), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-11-29 04:46:10,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 144 transitions. [2023-11-29 04:46:10,677 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 144 transitions. Word has length 148 [2023-11-29 04:46:10,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:46:10,678 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 144 transitions. [2023-11-29 04:46:10,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-11-29 04:46:10,678 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 144 transitions. [2023-11-29 04:46:10,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2023-11-29 04:46:10,681 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:46:10,681 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:46:10,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:46:10,682 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:46:10,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:46:10,682 INFO L85 PathProgramCache]: Analyzing trace with hash -779357533, now seen corresponding path program 1 times [2023-11-29 04:46:10,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:46:10,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881851900] [2023-11-29 04:46:10,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:46:10,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:46:10,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat