./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a 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_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU --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 d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:00:03,784 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:00:03,897 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 22:00:03,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:00:03,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:00:03,931 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:00:03,932 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:00:03,933 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:00:03,933 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:00:03,934 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:00:03,934 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:00:03,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:00:03,936 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:00:03,936 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:00:03,937 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:00:03,937 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:00:03,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:00:03,938 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:00:03,939 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:00:03,939 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:00:03,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:00:03,940 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:00:03,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:00:03,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:00:03,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:00:03,942 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:00:03,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:00:03,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:00:03,944 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:00:03,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:00:03,945 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:00:03,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:00:03,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:03,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:00:03,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:00:03,947 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:00:03,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:00:03,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:00:03,948 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:00:03,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:00:03,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:00:03,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:00:03,950 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_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/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_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU 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 -> d32ec5a50162e1277d5b8e9598dff8d55e883556c57a5fb919336a65433989f7 [2024-10-31 22:00:04,237 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:00:04,273 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:00:04,276 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:00:04,278 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:00:04,278 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:00:04,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i Unable to find full path for "g++" [2024-10-31 22:00:06,885 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:00:07,136 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:00:07,137 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i [2024-10-31 22:00:07,150 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/data/77f416028/1d132f7ce4e64a7788aae4aee8240c7b/FLAG29e889901 [2024-10-31 22:00:07,498 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/data/77f416028/1d132f7ce4e64a7788aae4aee8240c7b [2024-10-31 22:00:07,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:00:07,507 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:00:07,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:07,516 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:00:07,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:00:07,532 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:07" (1/1) ... [2024-10-31 22:00:07,539 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1775b29e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:07, skipping insertion in model container [2024-10-31 22:00:07,540 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:07" (1/1) ... [2024-10-31 22:00:07,616 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:00:07,836 WARN L251 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_90a37537-8b2b-4b15-8374-6bb3d5662b9c/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i[919,932] [2024-10-31 22:00:07,964 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:07,990 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:00:08,006 WARN L251 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_90a37537-8b2b-4b15-8374-6bb3d5662b9c/sv-benchmarks/c/hardness-nfm22/hardness_codestructure_dependencies_file-86.i[919,932] [2024-10-31 22:00:08,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:08,071 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:00:08,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08 WrapperNode [2024-10-31 22:00:08,072 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:08,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:08,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:00:08,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:00:08,084 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (1/1) ... [2024-10-31 22:00:08,104 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (1/1) ... [2024-10-31 22:00:08,166 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2024-10-31 22:00:08,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:08,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:00:08,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:00:08,169 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:00:08,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (1/1) ... [2024-10-31 22:00:08,183 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (1/1) ... [2024-10-31 22:00:08,186 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (1/1) ... [2024-10-31 22:00:08,215 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]. [2024-10-31 22:00:08,215 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (1/1) ... [2024-10-31 22:00:08,216 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (1/1) ... [2024-10-31 22:00:08,224 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (1/1) ... [2024-10-31 22:00:08,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (1/1) ... [2024-10-31 22:00:08,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (1/1) ... [2024-10-31 22:00:08,234 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (1/1) ... [2024-10-31 22:00:08,244 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:00:08,245 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:00:08,245 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:00:08,245 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:00:08,246 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (1/1) ... [2024-10-31 22:00:08,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:08,266 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:00:08,282 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:00:08,289 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_90a37537-8b2b-4b15-8374-6bb3d5662b9c/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:00:08,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:00:08,326 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:00:08,327 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:00:08,327 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:00:08,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:00:08,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:00:08,421 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:00:08,424 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:00:09,091 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-10-31 22:00:09,092 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:00:09,124 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:00:09,125 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:00:09,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:09 BoogieIcfgContainer [2024-10-31 22:00:09,125 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:00:09,131 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:00:09,131 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:00:09,142 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:00:09,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:00:07" (1/3) ... [2024-10-31 22:00:09,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d5987a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:09, skipping insertion in model container [2024-10-31 22:00:09,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:08" (2/3) ... [2024-10-31 22:00:09,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24d5987a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:09, skipping insertion in model container [2024-10-31 22:00:09,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:09" (3/3) ... [2024-10-31 22:00:09,146 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_codestructure_dependencies_file-86.i [2024-10-31 22:00:09,171 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:00:09,171 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:00:09,259 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:00:09,266 INFO L333 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, 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;@55c56983, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:00:09,267 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:00:09,273 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 22:00:09,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:00:09,287 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:09,288 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:09,288 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:09,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:09,295 INFO L85 PathProgramCache]: Analyzing trace with hash 2100497442, now seen corresponding path program 1 times [2024-10-31 22:00:09,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:09,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472700117] [2024-10-31 22:00:09,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:09,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:09,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:00:09,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:00:09,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:00:09,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:00:09,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:00:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:00:09,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:00:09,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:00:09,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:00:09,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:00:09,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:09,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-31 22:00:09,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:00:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-31 22:00:09,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,906 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:09,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:09,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472700117] [2024-10-31 22:00:09,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472700117] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:09,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:09,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:00:09,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802446756] [2024-10-31 22:00:09,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:09,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:00:09,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:09,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:00:09,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:00:09,954 INFO L87 Difference]: Start difference. First operand has 52 states, 34 states have (on average 1.4411764705882353) internal successors, (49), 35 states have internal predecessors, (49), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-31 22:00:09,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:09,993 INFO L93 Difference]: Finished difference Result 97 states and 167 transitions. [2024-10-31 22:00:09,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:00:09,997 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 98 [2024-10-31 22:00:09,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:10,009 INFO L225 Difference]: With dead ends: 97 [2024-10-31 22:00:10,009 INFO L226 Difference]: Without dead ends: 48 [2024-10-31 22:00:10,014 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:00:10,020 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:10,022 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:10,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-10-31 22:00:10,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-10-31 22:00:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 31 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-31 22:00:10,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 71 transitions. [2024-10-31 22:00:10,101 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 71 transitions. Word has length 98 [2024-10-31 22:00:10,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:10,102 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 71 transitions. [2024-10-31 22:00:10,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-31 22:00:10,103 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 71 transitions. [2024-10-31 22:00:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:00:10,113 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:10,113 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:10,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:00:10,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:10,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:10,116 INFO L85 PathProgramCache]: Analyzing trace with hash 1585339296, now seen corresponding path program 1 times [2024-10-31 22:00:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:10,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624521294] [2024-10-31 22:00:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:10,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:10,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:00:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:00:10,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:00:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:00:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:00:10,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:00:10,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:00:10,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:00:10,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:00:10,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:00:10,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:10,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-31 22:00:10,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:00:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-31 22:00:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:10,821 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:10,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:10,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624521294] [2024-10-31 22:00:10,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624521294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:10,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:10,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:00:10,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771681959] [2024-10-31 22:00:10,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:10,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:00:10,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:10,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:00:10,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:00:10,829 INFO L87 Difference]: Start difference. First operand 48 states and 71 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:11,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:11,061 INFO L93 Difference]: Finished difference Result 139 states and 208 transitions. [2024-10-31 22:00:11,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-31 22:00:11,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-31 22:00:11,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:11,067 INFO L225 Difference]: With dead ends: 139 [2024-10-31 22:00:11,070 INFO L226 Difference]: Without dead ends: 94 [2024-10-31 22:00:11,071 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:00:11,072 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 86 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:11,072 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 191 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:00:11,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-10-31 22:00:11,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2024-10-31 22:00:11,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-31 22:00:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 120 transitions. [2024-10-31 22:00:11,103 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 120 transitions. Word has length 98 [2024-10-31 22:00:11,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:11,103 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 120 transitions. [2024-10-31 22:00:11,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:11,104 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 120 transitions. [2024-10-31 22:00:11,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:00:11,106 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:11,106 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:11,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:00:11,107 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:11,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:11,108 INFO L85 PathProgramCache]: Analyzing trace with hash -2029569630, now seen corresponding path program 1 times [2024-10-31 22:00:11,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:11,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137302331] [2024-10-31 22:00:11,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:11,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:00:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:00:16,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:00:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:00:16,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:00:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:00:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:00:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:00:16,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:00:16,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:00:16,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-31 22:00:16,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:00:16,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-31 22:00:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,877 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:16,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:16,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137302331] [2024-10-31 22:00:16,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137302331] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:16,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:16,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-31 22:00:16,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512208176] [2024-10-31 22:00:16,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:16,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:00:16,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:16,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:00:16,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:00:16,882 INFO L87 Difference]: Start difference. First operand 80 states and 120 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:18,884 INFO L93 Difference]: Finished difference Result 185 states and 268 transitions. [2024-10-31 22:00:18,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:00:18,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-31 22:00:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:18,891 INFO L225 Difference]: With dead ends: 185 [2024-10-31 22:00:18,893 INFO L226 Difference]: Without dead ends: 140 [2024-10-31 22:00:18,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:00:18,896 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 106 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:18,899 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 237 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-31 22:00:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-31 22:00:18,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 97. [2024-10-31 22:00:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.3125) internal successors, (84), 64 states have internal predecessors, (84), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-31 22:00:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 144 transitions. [2024-10-31 22:00:18,935 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 144 transitions. Word has length 98 [2024-10-31 22:00:18,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:18,936 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 144 transitions. [2024-10-31 22:00:18,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:18,936 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 144 transitions. [2024-10-31 22:00:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-10-31 22:00:18,942 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:18,942 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:18,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:00:18,943 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:18,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:18,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1872370656, now seen corresponding path program 1 times [2024-10-31 22:00:18,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:18,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322466427] [2024-10-31 22:00:18,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:18,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:00:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:00:19,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:00:19,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:00:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:00:19,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:00:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:00:19,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:00:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:00:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:00:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-31 22:00:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:00:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-31 22:00:19,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:19,130 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:19,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:19,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322466427] [2024-10-31 22:00:19,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322466427] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:19,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:19,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:00:19,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72505701] [2024-10-31 22:00:19,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:19,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:00:19,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:19,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:00:19,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:00:19,139 INFO L87 Difference]: Start difference. First operand 97 states and 144 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:19,218 INFO L93 Difference]: Finished difference Result 204 states and 303 transitions. [2024-10-31 22:00:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:00:19,219 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 98 [2024-10-31 22:00:19,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:19,221 INFO L225 Difference]: With dead ends: 204 [2024-10-31 22:00:19,224 INFO L226 Difference]: Without dead ends: 143 [2024-10-31 22:00:19,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:00:19,227 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 63 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-31 22:00:19,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 139 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-31 22:00:19,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2024-10-31 22:00:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 92 states have (on average 1.2826086956521738) internal successors, (118), 92 states have internal predecessors, (118), 45 states have call successors, (45), 3 states have call predecessors, (45), 3 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2024-10-31 22:00:19,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2024-10-31 22:00:19,255 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 98 [2024-10-31 22:00:19,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:19,256 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2024-10-31 22:00:19,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-31 22:00:19,256 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2024-10-31 22:00:19,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-10-31 22:00:19,261 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:19,261 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:19,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:00:19,262 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:19,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:19,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1561352705, now seen corresponding path program 1 times [2024-10-31 22:00:19,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:00:19,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888865191] [2024-10-31 22:00:19,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:19,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:00:19,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 22:00:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 22:00:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 22:00:33,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 22:00:33,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 22:00:33,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 22:00:33,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 22:00:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 22:00:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 22:00:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 22:00:33,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 22:00:33,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-31 22:00:33,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-31 22:00:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-31 22:00:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-31 22:00:33,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:33,258 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-31 22:00:33,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:00:33,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888865191] [2024-10-31 22:00:33,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888865191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:33,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:33,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-31 22:00:33,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202728393] [2024-10-31 22:00:33,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:33,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-31 22:00:33,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:00:33,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-31 22:00:33,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:00:33,265 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 11 states have internal predecessors, (27), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15)