./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/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_fa850afd-83a8-4fc2-9779-fdd2f1003c01/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/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_fa850afd-83a8-4fc2-9779-fdd2f1003c01/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 5c581b69fd672134ca994dfa5a3ffe1c4c6d7d4efa55ea6e444f7b9681e450b7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:01:47,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:01:47,089 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 04:01:47,094 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:01:47,094 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:01:47,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:01:47,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:01:47,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:01:47,121 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:01:47,121 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:01:47,122 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:01:47,122 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:01:47,123 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:01:47,124 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:01:47,124 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:01:47,125 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:01:47,125 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 04:01:47,126 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:01:47,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:01:47,126 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:01:47,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:01:47,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 04:01:47,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:01:47,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 04:01:47,128 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:01:47,129 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 04:01:47,129 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:01:47,130 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:01:47,130 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:01:47,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:01:47,131 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:01:47,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:01:47,131 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:01:47,131 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:01:47,132 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 04:01:47,132 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:01:47,132 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:01:47,132 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:01:47,132 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:01:47,133 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 04:01:47,133 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:01:47,133 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:01:47,133 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_fa850afd-83a8-4fc2-9779-fdd2f1003c01/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_fa850afd-83a8-4fc2-9779-fdd2f1003c01/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 -> 5c581b69fd672134ca994dfa5a3ffe1c4c6d7d4efa55ea6e444f7b9681e450b7 [2023-11-29 04:01:47,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:01:47,401 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:01:47,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:01:47,405 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:01:47,406 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:01:47,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i [2023-11-29 04:01:50,267 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:01:50,470 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:01:50,471 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i [2023-11-29 04:01:50,481 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/bin/uautomizer-verify-BQ2R08f2Ya/data/21c1944ce/11973f02199a4f6c86a9c3b591ef3552/FLAG90bb833bd [2023-11-29 04:01:50,498 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/bin/uautomizer-verify-BQ2R08f2Ya/data/21c1944ce/11973f02199a4f6c86a9c3b591ef3552 [2023-11-29 04:01:50,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:01:50,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:01:50,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:01:50,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:01:50,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:01:50,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:01:50" (1/1) ... [2023-11-29 04:01:50,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d18f073 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50, skipping insertion in model container [2023-11-29 04:01:50,514 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:01:50" (1/1) ... [2023-11-29 04:01:50,547 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:01:50,715 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_fa850afd-83a8-4fc2-9779-fdd2f1003c01/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i[916,929] [2023-11-29 04:01:50,760 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:01:50,774 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:01:50,788 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_fa850afd-83a8-4fc2-9779-fdd2f1003c01/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-90.i[916,929] [2023-11-29 04:01:50,810 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:01:50,828 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:01:50,829 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50 WrapperNode [2023-11-29 04:01:50,829 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:01:50,830 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:01:50,830 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:01:50,830 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:01:50,838 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:01:50" (1/1) ... [2023-11-29 04:01:50,847 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:01:50" (1/1) ... [2023-11-29 04:01:50,876 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2023-11-29 04:01:50,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:01:50,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:01:50,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:01:50,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:01:50,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50" (1/1) ... [2023-11-29 04:01:50,890 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50" (1/1) ... [2023-11-29 04:01:50,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50" (1/1) ... [2023-11-29 04:01:50,907 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:01:50,908 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50" (1/1) ... [2023-11-29 04:01:50,908 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50" (1/1) ... [2023-11-29 04:01:50,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50" (1/1) ... [2023-11-29 04:01:50,918 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50" (1/1) ... [2023-11-29 04:01:50,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50" (1/1) ... [2023-11-29 04:01:50,922 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50" (1/1) ... [2023-11-29 04:01:50,925 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:01:50,926 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:01:50,926 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:01:50,926 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:01:50,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50" (1/1) ... [2023-11-29 04:01:50,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:01:50,960 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:01:50,982 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/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:01:51,031 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/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:01:51,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:01:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 04:01:51,061 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 04:01:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 04:01:51,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:01:51,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:01:51,149 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:01:51,151 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:01:51,414 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:01:51,456 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:01:51,456 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:01:51,457 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:01:51 BoogieIcfgContainer [2023-11-29 04:01:51,457 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:01:51,460 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:01:51,460 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:01:51,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:01:51,464 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:01:50" (1/3) ... [2023-11-29 04:01:51,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c557a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:01:51, skipping insertion in model container [2023-11-29 04:01:51,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:01:50" (2/3) ... [2023-11-29 04:01:51,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c557a62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:01:51, skipping insertion in model container [2023-11-29 04:01:51,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:01:51" (3/3) ... [2023-11-29 04:01:51,468 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-90.i [2023-11-29 04:01:51,489 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:01:51,489 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 04:01:51,544 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:01:51,552 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;@24f52b94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:01:51,552 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 04:01:51,556 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:01:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 04:01:51,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:01:51,573 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:51,574 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:01:51,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:01:51,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1356584365, now seen corresponding path program 1 times [2023-11-29 04:01:51,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:01:51,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608776203] [2023-11-29 04:01:51,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:01:51,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:01:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:01:51,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:01:51,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:01:51,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:01:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:01:51,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:01:51,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:01:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:01:51,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:01:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:01:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:01:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:01:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:01:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:01:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:01:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:01:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:01:51,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:01:51,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:01:51,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:01:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 04:01:51,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:01:51,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608776203] [2023-11-29 04:01:51,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608776203] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:01:51,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:01:51,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:01:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571994301] [2023-11-29 04:01:51,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:01:51,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 04:01:51,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:01:52,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 04:01:52,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 04:01:52,009 INFO L87 Difference]: Start difference. First operand has 51 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 04:01:52,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:01:52,066 INFO L93 Difference]: Finished difference Result 99 states and 178 transitions. [2023-11-29 04:01:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 04:01:52,069 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 120 [2023-11-29 04:01:52,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:01:52,078 INFO L225 Difference]: With dead ends: 99 [2023-11-29 04:01:52,078 INFO L226 Difference]: Without dead ends: 49 [2023-11-29 04:01:52,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 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:01:52,086 INFO L413 NwaCegarLoop]: 72 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, 72 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:01:52,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:01:52,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-11-29 04:01:52,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-11-29 04:01:52,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:01:52,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 75 transitions. [2023-11-29 04:01:52,138 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 75 transitions. Word has length 120 [2023-11-29 04:01:52,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:01:52,138 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 75 transitions. [2023-11-29 04:01:52,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2023-11-29 04:01:52,139 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 75 transitions. [2023-11-29 04:01:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 04:01:52,142 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:01:52,143 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:52,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:01:52,143 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:01:52,144 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:01:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash -997376595, now seen corresponding path program 1 times [2023-11-29 04:01:52,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:01:52,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030509932] [2023-11-29 04:01:52,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:01:52,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:01:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:01:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:01:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:01:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:01:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:01:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:01:58,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:01:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:01:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:01:58,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:01:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:01:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:01:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:01:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:01:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:01:58,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:01:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:01:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:01:58,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:01:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:01:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:01:58,096 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 04:01:58,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:01:58,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030509932] [2023-11-29 04:01:58,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030509932] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:01:58,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:01:58,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:01:58,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162057785] [2023-11-29 04:01:58,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:01:58,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:01:58,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:01:58,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:01:58,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:01:58,102 INFO L87 Difference]: Start difference. First operand 49 states and 75 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:01:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:01:59,173 INFO L93 Difference]: Finished difference Result 95 states and 132 transitions. [2023-11-29 04:01:59,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:01:59,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-11-29 04:01:59,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:01:59,177 INFO L225 Difference]: With dead ends: 95 [2023-11-29 04:01:59,177 INFO L226 Difference]: Without dead ends: 93 [2023-11-29 04:01:59,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:01:59,180 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 87 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:01:59,180 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 304 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 04:01:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-29 04:01:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2023-11-29 04:01:59,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 04:01:59,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2023-11-29 04:01:59,215 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 120 [2023-11-29 04:01:59,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:01:59,217 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2023-11-29 04:01:59,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:01:59,217 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2023-11-29 04:01:59,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 04:01:59,220 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:01:59,220 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:59,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:01:59,221 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:01:59,221 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:01:59,221 INFO L85 PathProgramCache]: Analyzing trace with hash -997317013, now seen corresponding path program 1 times [2023-11-29 04:01:59,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:01:59,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254960262] [2023-11-29 04:01:59,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:01:59,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:01:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:02:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:02:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:02:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:02:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:02:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:02:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:02:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:02:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:02:01,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:02:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:02:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:02:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:02:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:02:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:02:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:02:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:02:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:02:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:02:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:02:01,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:01,508 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 04:02:01,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:01,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254960262] [2023-11-29 04:02:01,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254960262] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:01,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:01,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:02:01,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964351218] [2023-11-29 04:02:01,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:01,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:02:01,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:01,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:02:01,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:02:01,512 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:02,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:02:02,332 INFO L93 Difference]: Finished difference Result 93 states and 130 transitions. [2023-11-29 04:02:02,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:02:02,333 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-11-29 04:02:02,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:02:02,336 INFO L225 Difference]: With dead ends: 93 [2023-11-29 04:02:02,336 INFO L226 Difference]: Without dead ends: 91 [2023-11-29 04:02:02,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:02:02,338 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 84 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:02:02,339 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 311 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:02:02,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-11-29 04:02:02,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2023-11-29 04:02:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2023-11-29 04:02:02,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 120 transitions. [2023-11-29 04:02:02,365 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 120 transitions. Word has length 120 [2023-11-29 04:02:02,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:02:02,366 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 120 transitions. [2023-11-29 04:02:02,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:02,366 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 120 transitions. [2023-11-29 04:02:02,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 04:02:02,369 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:02:02,369 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:02,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:02:02,369 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:02:02,370 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:02,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1054634897, now seen corresponding path program 1 times [2023-11-29 04:02:02,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:02,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95148459] [2023-11-29 04:02:02,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:02,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:02:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:02:05,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:02:05,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:02:05,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:02:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:02:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:02:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:02:05,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:02:05,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:02:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:02:05,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:02:05,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:02:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:02:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:02:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:02:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:02:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:02:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:02:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:02:05,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 04:02:05,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:05,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95148459] [2023-11-29 04:02:05,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95148459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:05,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:05,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:02:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066503791] [2023-11-29 04:02:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:05,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:02:05,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:02:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:02:05,651 INFO L87 Difference]: Start difference. First operand 82 states and 120 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:06,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:02:06,464 INFO L93 Difference]: Finished difference Result 123 states and 169 transitions. [2023-11-29 04:02:06,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:02:06,465 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-11-29 04:02:06,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:02:06,469 INFO L225 Difference]: With dead ends: 123 [2023-11-29 04:02:06,469 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 04:02:06,470 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:02:06,471 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 90 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:02:06,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 247 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:02:06,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 04:02:06,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 106. [2023-11-29 04:02:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 64 states have internal predecessors, (75), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 04:02:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2023-11-29 04:02:06,507 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 120 [2023-11-29 04:02:06,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:02:06,508 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2023-11-29 04:02:06,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:06,509 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2023-11-29 04:02:06,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2023-11-29 04:02:06,511 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:02:06,511 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:06,512 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:02:06,512 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:02:06,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:06,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1054575315, now seen corresponding path program 1 times [2023-11-29 04:02:06,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:06,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608530631] [2023-11-29 04:02:06,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:06,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:02:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:02:08,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:02:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:02:08,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:02:08,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:02:08,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:02:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:02:08,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:02:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:02:08,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:02:08,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:02:08,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:02:08,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:02:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:02:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:02:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:02:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:02:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:02:08,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:02:08,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:08,088 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 04:02:08,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:08,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608530631] [2023-11-29 04:02:08,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608530631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:08,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:08,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 04:02:08,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248966728] [2023-11-29 04:02:08,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:08,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:02:08,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:08,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:02:08,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:02:08,092 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:08,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:02:08,821 INFO L93 Difference]: Finished difference Result 115 states and 159 transitions. [2023-11-29 04:02:08,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:02:08,822 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 120 [2023-11-29 04:02:08,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:02:08,824 INFO L225 Difference]: With dead ends: 115 [2023-11-29 04:02:08,824 INFO L226 Difference]: Without dead ends: 113 [2023-11-29 04:02:08,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:02:08,825 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 84 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:02:08,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 280 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:02:08,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-29 04:02:08,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2023-11-29 04:02:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 60 states have internal predecessors, (69), 38 states have call successors, (38), 5 states have call predecessors, (38), 5 states have return successors, (38), 36 states have call predecessors, (38), 38 states have call successors, (38) [2023-11-29 04:02:08,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2023-11-29 04:02:08,858 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 120 [2023-11-29 04:02:08,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:02:08,859 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2023-11-29 04:02:08,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:08,860 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2023-11-29 04:02:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 04:02:08,861 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:02:08,862 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:08,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:02:08,862 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:02:08,862 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:08,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1148591013, now seen corresponding path program 1 times [2023-11-29 04:02:08,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:08,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588409287] [2023-11-29 04:02:08,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:08,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:08,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:02:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:02:12,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:02:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:02:12,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:02:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:02:12,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:02:12,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:02:12,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:02:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:02:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:02:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:02:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:02:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:02:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:02:12,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:02:12,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:02:12,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:02:12,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:02:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:02:12,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:12,494 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 04:02:12,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:12,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588409287] [2023-11-29 04:02:12,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588409287] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:12,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:12,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:02:12,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716846533] [2023-11-29 04:02:12,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:12,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:02:12,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:12,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:02:12,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:02:12,498 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:13,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:02:13,826 INFO L93 Difference]: Finished difference Result 148 states and 201 transitions. [2023-11-29 04:02:13,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:02:13,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-11-29 04:02:13,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:02:13,828 INFO L225 Difference]: With dead ends: 148 [2023-11-29 04:02:13,828 INFO L226 Difference]: Without dead ends: 146 [2023-11-29 04:02:13,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2023-11-29 04:02:13,830 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 120 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 251 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:02:13,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 331 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:02:13,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-11-29 04:02:13,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 65. [2023-11-29 04:02:13,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2926829268292683) internal successors, (53), 41 states have internal predecessors, (53), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:02:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2023-11-29 04:02:13,845 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 121 [2023-11-29 04:02:13,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:02:13,845 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2023-11-29 04:02:13,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2023-11-29 04:02:13,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 04:02:13,846 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:02:13,847 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:13,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:02:13,847 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:02:13,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:13,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1091392293, now seen corresponding path program 1 times [2023-11-29 04:02:13,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:13,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337085376] [2023-11-29 04:02:13,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:13,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:02:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:02:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:02:15,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:02:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:02:15,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:02:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:02:15,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:02:15,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:02:15,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:02:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:02:15,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:02:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:02:15,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:02:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:02:15,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:02:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:02:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:02:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:02:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:02:15,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:15,877 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 04:02:15,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:15,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337085376] [2023-11-29 04:02:15,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337085376] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:15,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:15,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:02:15,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783881299] [2023-11-29 04:02:15,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:15,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:02:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:15,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:02:15,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:02:15,881 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:02:17,243 INFO L93 Difference]: Finished difference Result 126 states and 171 transitions. [2023-11-29 04:02:17,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:02:17,243 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-11-29 04:02:17,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:02:17,245 INFO L225 Difference]: With dead ends: 126 [2023-11-29 04:02:17,245 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 04:02:17,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=108, Invalid=198, Unknown=0, NotChecked=0, Total=306 [2023-11-29 04:02:17,246 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 119 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:02:17,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 314 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 04:02:17,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 04:02:17,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 64. [2023-11-29 04:02:17,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.275) internal successors, (51), 40 states have internal predecessors, (51), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:02:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 91 transitions. [2023-11-29 04:02:17,268 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 91 transitions. Word has length 121 [2023-11-29 04:02:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:02:17,269 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 91 transitions. [2023-11-29 04:02:17,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:17,269 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 91 transitions. [2023-11-29 04:02:17,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 04:02:17,271 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:02:17,271 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:17,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:02:17,271 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:02:17,272 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1371368921, now seen corresponding path program 1 times [2023-11-29 04:02:17,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:17,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690943597] [2023-11-29 04:02:17,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:17,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:02:20,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:02:20,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:02:20,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:02:20,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:02:20,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:02:20,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:02:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:02:20,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:02:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:02:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:02:20,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:02:20,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:02:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:02:20,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:02:20,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:02:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:02:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:02:20,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:02:20,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:02:20,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 04:02:20,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:20,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690943597] [2023-11-29 04:02:20,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690943597] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:20,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:20,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:02:20,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937524114] [2023-11-29 04:02:20,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:20,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:02:20,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:20,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:02:20,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:02:20,121 INFO L87 Difference]: Start difference. First operand 64 states and 91 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:02:20,947 INFO L93 Difference]: Finished difference Result 129 states and 174 transitions. [2023-11-29 04:02:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:02:20,947 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-11-29 04:02:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:02:20,949 INFO L225 Difference]: With dead ends: 129 [2023-11-29 04:02:20,949 INFO L226 Difference]: Without dead ends: 127 [2023-11-29 04:02:20,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:02:20,950 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 145 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:02:20,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 251 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:02:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2023-11-29 04:02:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 62. [2023-11-29 04:02:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:02:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2023-11-29 04:02:20,970 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 121 [2023-11-29 04:02:20,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:02:20,971 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2023-11-29 04:02:20,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2023-11-29 04:02:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 04:02:20,972 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:02:20,972 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:20,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:02:20,972 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:02:20,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:20,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1371309339, now seen corresponding path program 1 times [2023-11-29 04:02:20,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:20,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131813774] [2023-11-29 04:02:20,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:20,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:02:22,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:02:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:02:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:02:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:02:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:02:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:02:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:02:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:02:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:02:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:02:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:02:22,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:02:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:02:22,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:02:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:02:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:02:22,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:02:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:02:22,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:02:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:22,664 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 04:02:22,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:22,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131813774] [2023-11-29 04:02:22,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131813774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:22,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:22,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:02:22,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123636429] [2023-11-29 04:02:22,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:22,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:02:22,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:22,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:02:22,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:02:22,667 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:02:23,338 INFO L93 Difference]: Finished difference Result 125 states and 170 transitions. [2023-11-29 04:02:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:02:23,339 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-11-29 04:02:23,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:02:23,340 INFO L225 Difference]: With dead ends: 125 [2023-11-29 04:02:23,340 INFO L226 Difference]: Without dead ends: 123 [2023-11-29 04:02:23,340 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:02:23,341 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 131 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:02:23,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 252 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:02:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-29 04:02:23,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 62. [2023-11-29 04:02:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.263157894736842) internal successors, (48), 38 states have internal predecessors, (48), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-29 04:02:23,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2023-11-29 04:02:23,364 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 121 [2023-11-29 04:02:23,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:02:23,365 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2023-11-29 04:02:23,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:23,365 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2023-11-29 04:02:23,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2023-11-29 04:02:23,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:02:23,367 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02:23,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 04:02:23,367 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 04:02:23,367 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:02:23,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1428567641, now seen corresponding path program 1 times [2023-11-29 04:02:23,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:02:23,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654475104] [2023-11-29 04:02:23,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:02:23,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:02:23,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 04:02:25,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2023-11-29 04:02:25,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 04:02:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 04:02:25,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2023-11-29 04:02:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-29 04:02:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-29 04:02:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 04:02:25,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 04:02:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 04:02:25,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2023-11-29 04:02:25,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 04:02:25,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2023-11-29 04:02:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2023-11-29 04:02:25,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-29 04:02:25,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2023-11-29 04:02:25,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-29 04:02:25,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 04:02:25,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 04:02:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2023-11-29 04:02:25,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:02:25,297 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2023-11-29 04:02:25,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:02:25,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654475104] [2023-11-29 04:02:25,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654475104] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:02:25,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:02:25,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 04:02:25,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472653818] [2023-11-29 04:02:25,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:02:25,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:02:25,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:02:25,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:02:25,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:02:25,300 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:02:26,255 INFO L93 Difference]: Finished difference Result 119 states and 163 transitions. [2023-11-29 04:02:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:02:26,256 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 121 [2023-11-29 04:02:26,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:02:26,256 INFO L225 Difference]: With dead ends: 119 [2023-11-29 04:02:26,256 INFO L226 Difference]: Without dead ends: 0 [2023-11-29 04:02:26,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:02:26,258 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 104 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:02:26,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 321 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 04:02:26,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-29 04:02:26,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-29 04:02:26,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:02:26,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-29 04:02:26,260 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2023-11-29 04:02:26,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:02:26,260 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-29 04:02:26,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 9 states have internal predecessors, (24), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2023-11-29 04:02:26,261 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-29 04:02:26,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-29 04:02:26,263 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 04:02:26,264 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 04:02:26,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-29 04:02:27,576 INFO L902 garLoopResultBuilder]: At program point L93(line 93) the Hoare annotation is: true [2023-11-29 04:02:27,576 INFO L902 garLoopResultBuilder]: At program point L93-1(line 93) the Hoare annotation is: true [2023-11-29 04:02:27,576 INFO L899 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2023-11-29 04:02:27,577 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-29 04:02:27,577 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-29 04:02:27,577 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-29 04:02:27,577 INFO L902 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: true [2023-11-29 04:02:27,577 INFO L902 garLoopResultBuilder]: At program point L102-1(line 102) the Hoare annotation is: true [2023-11-29 04:02:27,577 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 71) no Hoare annotation was computed. [2023-11-29 04:02:27,577 INFO L899 garLoopResultBuilder]: For program point L94(line 94) no Hoare annotation was computed. [2023-11-29 04:02:27,577 INFO L895 garLoopResultBuilder]: At program point L78(line 78) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 04:02:27,577 INFO L895 garLoopResultBuilder]: At program point L78-1(line 78) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 04:02:27,577 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-11-29 04:02:27,577 INFO L899 garLoopResultBuilder]: For program point L45-1(lines 42 72) no Hoare annotation was computed. [2023-11-29 04:02:27,577 INFO L899 garLoopResultBuilder]: For program point L103(lines 73 104) no Hoare annotation was computed. [2023-11-29 04:02:27,578 INFO L895 garLoopResultBuilder]: At program point L87(line 87) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 04:02:27,578 INFO L895 garLoopResultBuilder]: At program point L87-1(line 87) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 04:02:27,578 INFO L899 garLoopResultBuilder]: For program point L79(line 79) no Hoare annotation was computed. [2023-11-29 04:02:27,578 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-29 04:02:27,578 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-29 04:02:27,578 INFO L902 garLoopResultBuilder]: At program point L96(line 96) the Hoare annotation is: true [2023-11-29 04:02:27,578 INFO L902 garLoopResultBuilder]: At program point L96-1(line 96) the Hoare annotation is: true [2023-11-29 04:02:27,578 INFO L899 garLoopResultBuilder]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2023-11-29 04:02:27,578 INFO L899 garLoopResultBuilder]: For program point L88(line 88) no Hoare annotation was computed. [2023-11-29 04:02:27,578 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-11-29 04:02:27,578 INFO L899 garLoopResultBuilder]: For program point L97(line 97) no Hoare annotation was computed. [2023-11-29 04:02:27,578 INFO L895 garLoopResultBuilder]: At program point L81(line 81) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 04:02:27,579 INFO L895 garLoopResultBuilder]: At program point L81-1(line 81) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 04:02:27,579 INFO L902 garLoopResultBuilder]: At program point L90(line 90) the Hoare annotation is: true [2023-11-29 04:02:27,579 INFO L902 garLoopResultBuilder]: At program point L90-1(line 90) the Hoare annotation is: true [2023-11-29 04:02:27,579 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-29 04:02:27,579 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2023-11-29 04:02:27,579 INFO L902 garLoopResultBuilder]: At program point L99(line 99) the Hoare annotation is: true [2023-11-29 04:02:27,579 INFO L902 garLoopResultBuilder]: At program point L99-1(line 99) the Hoare annotation is: true [2023-11-29 04:02:27,579 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-29 04:02:27,579 INFO L899 garLoopResultBuilder]: For program point L91(line 91) no Hoare annotation was computed. [2023-11-29 04:02:27,579 INFO L899 garLoopResultBuilder]: For program point L58(lines 42 72) no Hoare annotation was computed. [2023-11-29 04:02:27,580 INFO L895 garLoopResultBuilder]: At program point L75(line 75) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 04:02:27,580 INFO L895 garLoopResultBuilder]: At program point L75-1(line 75) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 04:02:27,580 INFO L899 garLoopResultBuilder]: For program point L42(lines 42 72) no Hoare annotation was computed. [2023-11-29 04:02:27,580 INFO L899 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2023-11-29 04:02:27,580 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 61) no Hoare annotation was computed. [2023-11-29 04:02:27,580 INFO L895 garLoopResultBuilder]: At program point L84(line 84) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 04:02:27,580 INFO L895 garLoopResultBuilder]: At program point L84-1(line 84) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 04:02:27,580 INFO L895 garLoopResultBuilder]: At program point L117-2(lines 117 123) the Hoare annotation is: (= (+ ~var_1_8~0 (* (div ~var_1_6~0 4294967296) 4294967296)) (+ (* (div ~var_1_8~0 4294967296) 4294967296) ~var_1_6~0)) [2023-11-29 04:02:27,580 INFO L899 garLoopResultBuilder]: For program point L117-3(lines 117 123) no Hoare annotation was computed. [2023-11-29 04:02:27,580 INFO L899 garLoopResultBuilder]: For program point L76(line 76) no Hoare annotation was computed. [2023-11-29 04:02:27,580 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-29 04:02:27,580 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-29 04:02:27,580 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-29 04:02:27,580 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-29 04:02:27,583 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:02:27,585 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 04:02:27,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 04:02:27 BoogieIcfgContainer [2023-11-29 04:02:27,595 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 04:02:27,596 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 04:02:27,596 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 04:02:27,596 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 04:02:27,596 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:01:51" (3/4) ... [2023-11-29 04:02:27,598 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-29 04:02:27,601 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-29 04:02:27,607 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2023-11-29 04:02:27,608 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2023-11-29 04:02:27,608 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-29 04:02:27,608 INFO L943 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-29 04:02:27,708 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/bin/uautomizer-verify-BQ2R08f2Ya/witness.graphml [2023-11-29 04:02:27,709 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/bin/uautomizer-verify-BQ2R08f2Ya/witness.yml [2023-11-29 04:02:27,709 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 04:02:27,710 INFO L158 Benchmark]: Toolchain (without parser) took 37207.05ms. Allocated memory was 142.6MB in the beginning and 438.3MB in the end (delta: 295.7MB). Free memory was 104.2MB in the beginning and 406.6MB in the end (delta: -302.3MB). Peak memory consumption was 252.6MB. Max. memory is 16.1GB. [2023-11-29 04:02:27,710 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:02:27,711 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.54ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 91.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 04:02:27,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.12ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:02:27,712 INFO L158 Benchmark]: Boogie Preprocessor took 47.52ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 86.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 04:02:27,712 INFO L158 Benchmark]: RCFGBuilder took 531.07ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 98.3MB in the end (delta: -11.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 04:02:27,712 INFO L158 Benchmark]: TraceAbstraction took 36135.30ms. Allocated memory was 142.6MB in the beginning and 438.3MB in the end (delta: 295.7MB). Free memory was 97.5MB in the beginning and 153.2MB in the end (delta: -55.7MB). Peak memory consumption was 249.7MB. Max. memory is 16.1GB. [2023-11-29 04:02:27,713 INFO L158 Benchmark]: Witness Printer took 113.50ms. Allocated memory is still 438.3MB. Free memory was 153.2MB in the beginning and 406.6MB in the end (delta: -253.4MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2023-11-29 04:02:27,715 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 107.0MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.54ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 91.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.12ms. Allocated memory is still 142.6MB. Free memory was 91.6MB in the beginning and 89.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.52ms. Allocated memory is still 142.6MB. Free memory was 89.5MB in the beginning and 86.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 531.07ms. Allocated memory is still 142.6MB. Free memory was 86.8MB in the beginning and 98.3MB in the end (delta: -11.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * TraceAbstraction took 36135.30ms. Allocated memory was 142.6MB in the beginning and 438.3MB in the end (delta: 295.7MB). Free memory was 97.5MB in the beginning and 153.2MB in the end (delta: -55.7MB). Peak memory consumption was 249.7MB. Max. memory is 16.1GB. * Witness Printer took 113.50ms. Allocated memory is still 438.3MB. Free memory was 153.2MB in the beginning and 406.6MB in the end (delta: -253.4MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.1s, OverallIterations: 10, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 964 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 964 mSDsluCounter, 2683 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1748 mSDsCounter, 147 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1719 IncrementalHoareTripleChecker+Invalid, 1866 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 147 mSolverCounterUnsat, 935 mSDtfsCounter, 1719 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 459 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=4, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 313 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 79 PreInvPairs, 122 NumberOfFragments, 176 HoareAnnotationTreeSize, 79 FomulaSimplifications, 21337882 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 22 FomulaSimplificationsInter, 39099 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 25.0s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1195 ConstructedInterpolants, 0 QuantifiedInterpolants, 9268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 7600/7600 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: ((var_1_8 + ((var_1_6 / 4294967296) * 4294967296)) == (((var_1_8 / 4294967296) * 4294967296) + var_1_6)) RESULT: Ultimate proved your program to be correct! [2023-11-29 04:02:27,753 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fa850afd-83a8-4fc2-9779-fdd2f1003c01/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE