./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.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_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/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_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/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_f47e9309-b35f-49ba-ad96-cd629ceb9113/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 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:42:41,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:42:41,104 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-29 06:42:41,108 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:42:41,109 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:42:41,134 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:42:41,134 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:42:41,135 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:42:41,136 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:42:41,136 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:42:41,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:42:41,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:42:41,138 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:42:41,139 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:42:41,139 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:42:41,140 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:42:41,140 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:42:41,141 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:42:41,141 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 06:42:41,142 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:42:41,142 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:42:41,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:42:41,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:42:41,144 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:42:41,144 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:42:41,145 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:42:41,145 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:42:41,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:42:41,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:42:41,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:42:41,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:42:41,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:42:41,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:42:41,148 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:42:41,148 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:42:41,148 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 06:42:41,148 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 06:42:41,149 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:42:41,149 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:42:41,149 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:42:41,149 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:42:41,150 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:42:41,150 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_f47e9309-b35f-49ba-ad96-cd629ceb9113/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_f47e9309-b35f-49ba-ad96-cd629ceb9113/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 -> 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae [2023-11-29 06:42:41,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:42:41,386 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:42:41,389 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:42:41,390 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:42:41,390 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:42:41,391 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2023-11-29 06:42:44,187 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:42:44,364 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:42:44,364 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2023-11-29 06:42:44,375 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/data/1456f66ac/5d31b752a3724a03b5d4c44fff78f1eb/FLAG676865945 [2023-11-29 06:42:44,388 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/data/1456f66ac/5d31b752a3724a03b5d4c44fff78f1eb [2023-11-29 06:42:44,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:42:44,392 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:42:44,393 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:42:44,393 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:42:44,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:42:44,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b58946f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44, skipping insertion in model container [2023-11-29 06:42:44,400 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,428 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:42:44,545 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_f47e9309-b35f-49ba-ad96-cd629ceb9113/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i[916,929] [2023-11-29 06:42:44,603 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:42:44,617 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:42:44,630 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_f47e9309-b35f-49ba-ad96-cd629ceb9113/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i[916,929] [2023-11-29 06:42:44,669 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:42:44,689 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:42:44,689 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44 WrapperNode [2023-11-29 06:42:44,689 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:42:44,691 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:42:44,691 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:42:44,691 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:42:44,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,715 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,761 INFO L138 Inliner]: procedures = 29, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 397 [2023-11-29 06:42:44,761 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:42:44,762 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:42:44,762 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:42:44,763 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:42:44,776 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,777 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,806 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 38, 21, 34, 20]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 6, 2, 5, 3]. The 18 writes are split as follows [0, 7, 2, 6, 3]. [2023-11-29 06:42:44,806 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,807 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,830 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,835 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,839 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:42:44,850 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:42:44,850 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:42:44,850 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:42:44,851 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (1/1) ... [2023-11-29 06:42:44,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:42:44,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:42:44,886 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:42:44,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:42:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:42:44,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 06:42:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 06:42:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 06:42:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 06:42:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 06:42:44,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2023-11-29 06:42:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2023-11-29 06:42:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2023-11-29 06:42:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2023-11-29 06:42:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2023-11-29 06:42:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2023-11-29 06:42:44,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2023-11-29 06:42:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2023-11-29 06:42:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2023-11-29 06:42:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2023-11-29 06:42:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 06:42:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 06:42:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 06:42:44,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 06:42:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 06:42:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2023-11-29 06:42:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2023-11-29 06:42:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2023-11-29 06:42:44,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2023-11-29 06:42:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2023-11-29 06:42:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:42:44,932 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:42:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 06:42:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 06:42:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 06:42:44,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 06:42:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 06:42:44,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:42:44,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:42:45,074 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:42:45,077 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:42:45,542 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:42:45,582 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:42:45,582 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:42:45,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:42:45 BoogieIcfgContainer [2023-11-29 06:42:45,583 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:42:45,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:42:45,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:42:45,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:42:45,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:42:44" (1/3) ... [2023-11-29 06:42:45,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@baf3232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:42:45, skipping insertion in model container [2023-11-29 06:42:45,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:42:44" (2/3) ... [2023-11-29 06:42:45,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@baf3232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:42:45, skipping insertion in model container [2023-11-29 06:42:45,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:42:45" (3/3) ... [2023-11-29 06:42:45,593 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-34.i [2023-11-29 06:42:45,614 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:42:45,614 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:42:45,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:42:45,673 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;@572c4e5f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:42:45,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:42:45,677 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 06:42:45,693 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:45,694 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:45,695 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:45,699 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:45,700 INFO L85 PathProgramCache]: Analyzing trace with hash 370900315, now seen corresponding path program 1 times [2023-11-29 06:42:45,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:45,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412299687] [2023-11-29 06:42:45,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:45,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:45,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:46,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:46,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:46,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:46,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:46,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:46,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:46,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:46,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:46,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:46,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:46,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:46,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:46,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:46,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,144 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:46,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:46,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412299687] [2023-11-29 06:42:46,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412299687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:46,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:46,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:42:46,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955869848] [2023-11-29 06:42:46,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:46,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:42:46,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:46,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:42:46,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:42:46,187 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:46,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:46,239 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2023-11-29 06:42:46,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:42:46,241 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2023-11-29 06:42:46,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:46,250 INFO L225 Difference]: With dead ends: 223 [2023-11-29 06:42:46,250 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 06:42:46,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 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 06:42:46,258 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:46,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:42:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 06:42:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 06:42:46,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:46,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-11-29 06:42:46,311 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2023-11-29 06:42:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:46,311 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-11-29 06:42:46,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-11-29 06:42:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 06:42:46,317 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:46,318 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:46,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 06:42:46,318 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:46,319 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1750368993, now seen corresponding path program 1 times [2023-11-29 06:42:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:46,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123678415] [2023-11-29 06:42:46,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:46,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:46,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:46,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:46,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:46,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:46,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:46,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:46,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:46,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:46,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:46,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:46,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:46,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123678415] [2023-11-29 06:42:46,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123678415] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:46,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:46,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:42:46,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719108624] [2023-11-29 06:42:46,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:46,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:42:46,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:46,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:42:46,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:42:46,708 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:46,778 INFO L93 Difference]: Finished difference Result 227 states and 334 transitions. [2023-11-29 06:42:46,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:42:46,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2023-11-29 06:42:46,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:46,781 INFO L225 Difference]: With dead ends: 227 [2023-11-29 06:42:46,781 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 06:42:46,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:42:46,784 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 10 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:46,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 466 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:42:46,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 06:42:46,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2023-11-29 06:42:46,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:46,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2023-11-29 06:42:46,802 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 166 [2023-11-29 06:42:46,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:46,803 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2023-11-29 06:42:46,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2023-11-29 06:42:46,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 06:42:46,806 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:46,806 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:46,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 06:42:46,807 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:46,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:46,807 INFO L85 PathProgramCache]: Analyzing trace with hash 361074979, now seen corresponding path program 1 times [2023-11-29 06:42:46,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:46,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939641127] [2023-11-29 06:42:46,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:46,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:46,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:46,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:46,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:46,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:46,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:46,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:46,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:46,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:46,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:46,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:46,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:46,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:46,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:46,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:46,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:46,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:47,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:47,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:47,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,012 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:47,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:47,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939641127] [2023-11-29 06:42:47,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939641127] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:47,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:47,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:42:47,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490599423] [2023-11-29 06:42:47,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:47,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:47,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:47,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:47,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:47,016 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:47,052 INFO L93 Difference]: Finished difference Result 226 states and 331 transitions. [2023-11-29 06:42:47,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:47,053 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-11-29 06:42:47,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:47,055 INFO L225 Difference]: With dead ends: 226 [2023-11-29 06:42:47,055 INFO L226 Difference]: Without dead ends: 114 [2023-11-29 06:42:47,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:47,058 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 0 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:47,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 311 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:42:47,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-29 06:42:47,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2023-11-29 06:42:47,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.348314606741573) internal successors, (120), 89 states have internal predecessors, (120), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:47,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 166 transitions. [2023-11-29 06:42:47,073 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 166 transitions. Word has length 166 [2023-11-29 06:42:47,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:47,074 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 166 transitions. [2023-11-29 06:42:47,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:47,075 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 166 transitions. [2023-11-29 06:42:47,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 06:42:47,078 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:47,078 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:47,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 06:42:47,079 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:47,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:47,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1327868763, now seen corresponding path program 1 times [2023-11-29 06:42:47,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:47,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436631748] [2023-11-29 06:42:47,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:47,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:47,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:47,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:47,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:47,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:47,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:47,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:47,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:47,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:47,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:47,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:47,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:47,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:47,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:47,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:47,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:47,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:47,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:47,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436631748] [2023-11-29 06:42:47,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436631748] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:47,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:47,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:42:47,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949803595] [2023-11-29 06:42:47,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:47,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:42:47,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:47,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:42:47,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:42:47,366 INFO L87 Difference]: Start difference. First operand 114 states and 166 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:47,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:47,416 INFO L93 Difference]: Finished difference Result 251 states and 367 transitions. [2023-11-29 06:42:47,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:42:47,416 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-11-29 06:42:47,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:47,419 INFO L225 Difference]: With dead ends: 251 [2023-11-29 06:42:47,419 INFO L226 Difference]: Without dead ends: 138 [2023-11-29 06:42:47,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:42:47,421 INFO L413 NwaCegarLoop]: 175 mSDtfsCounter, 61 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:47,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 487 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:42:47,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2023-11-29 06:42:47,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 116. [2023-11-29 06:42:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:47,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2023-11-29 06:42:47,434 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 166 [2023-11-29 06:42:47,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:47,435 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2023-11-29 06:42:47,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:47,436 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2023-11-29 06:42:47,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-29 06:42:47,439 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:47,439 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:47,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 06:42:47,439 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:47,440 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:47,440 INFO L85 PathProgramCache]: Analyzing trace with hash -508912813, now seen corresponding path program 1 times [2023-11-29 06:42:47,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:47,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806262507] [2023-11-29 06:42:47,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:47,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:47,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:47,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:47,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:47,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:47,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:47,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:47,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:47,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,615 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:47,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:47,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806262507] [2023-11-29 06:42:47,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806262507] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:47,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:47,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:42:47,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65633895] [2023-11-29 06:42:47,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:47,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:47,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:47,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:47,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:47,619 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:47,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:47,652 INFO L93 Difference]: Finished difference Result 280 states and 406 transitions. [2023-11-29 06:42:47,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:47,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2023-11-29 06:42:47,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:47,654 INFO L225 Difference]: With dead ends: 280 [2023-11-29 06:42:47,655 INFO L226 Difference]: Without dead ends: 165 [2023-11-29 06:42:47,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:47,656 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 56 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:47,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 309 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:42:47,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-11-29 06:42:47,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 135. [2023-11-29 06:42:47,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 110 states have internal predecessors, (150), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:47,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 196 transitions. [2023-11-29 06:42:47,668 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 196 transitions. Word has length 168 [2023-11-29 06:42:47,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:47,669 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 196 transitions. [2023-11-29 06:42:47,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 196 transitions. [2023-11-29 06:42:47,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 06:42:47,672 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:47,672 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:47,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 06:42:47,673 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:47,673 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:47,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1632496881, now seen corresponding path program 1 times [2023-11-29 06:42:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:47,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405961145] [2023-11-29 06:42:47,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:47,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:47,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:47,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:47,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:47,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:47,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:47,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:47,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:47,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:47,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:47,838 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:47,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:47,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405961145] [2023-11-29 06:42:47,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405961145] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:47,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:47,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:42:47,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414057274] [2023-11-29 06:42:47,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:47,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:47,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:47,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:47,842 INFO L87 Difference]: Start difference. First operand 135 states and 196 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:47,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:47,872 INFO L93 Difference]: Finished difference Result 284 states and 413 transitions. [2023-11-29 06:42:47,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:47,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 171 [2023-11-29 06:42:47,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:47,875 INFO L225 Difference]: With dead ends: 284 [2023-11-29 06:42:47,875 INFO L226 Difference]: Without dead ends: 150 [2023-11-29 06:42:47,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:47,877 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 26 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:47,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 324 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:42:47,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-29 06:42:47,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2023-11-29 06:42:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 111 states have (on average 1.3603603603603605) internal successors, (151), 111 states have internal predecessors, (151), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 197 transitions. [2023-11-29 06:42:47,889 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 197 transitions. Word has length 171 [2023-11-29 06:42:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:47,890 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 197 transitions. [2023-11-29 06:42:47,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 197 transitions. [2023-11-29 06:42:47,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2023-11-29 06:42:47,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:47,893 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:47,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 06:42:47,893 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:47,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:47,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1890662319, now seen corresponding path program 1 times [2023-11-29 06:42:47,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:47,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646524425] [2023-11-29 06:42:47,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:47,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:47,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:48,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:48,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:48,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:48,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:48,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:48,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:48,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:48,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:48,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:48,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:48,425 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:48,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646524425] [2023-11-29 06:42:48,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646524425] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:48,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:48,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:42:48,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756586705] [2023-11-29 06:42:48,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:48,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:42:48,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:48,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:42:48,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:42:48,428 INFO L87 Difference]: Start difference. First operand 136 states and 197 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:48,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:48,651 INFO L93 Difference]: Finished difference Result 267 states and 387 transitions. [2023-11-29 06:42:48,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:42:48,651 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 171 [2023-11-29 06:42:48,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:48,653 INFO L225 Difference]: With dead ends: 267 [2023-11-29 06:42:48,653 INFO L226 Difference]: Without dead ends: 132 [2023-11-29 06:42:48,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:42:48,654 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 201 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:48,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 269 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:42:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-29 06:42:48,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2023-11-29 06:42:48,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:48,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 187 transitions. [2023-11-29 06:42:48,664 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 187 transitions. Word has length 171 [2023-11-29 06:42:48,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:48,665 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 187 transitions. [2023-11-29 06:42:48,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:48,665 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 187 transitions. [2023-11-29 06:42:48,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 06:42:48,667 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:48,667 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:48,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 06:42:48,667 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:48,667 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash 754124037, now seen corresponding path program 1 times [2023-11-29 06:42:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635111199] [2023-11-29 06:42:48,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:48,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:49,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:49,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:49,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:49,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:49,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:49,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:49,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:49,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:49,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:49,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:49,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:49,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:49,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:49,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:49,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:49,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:49,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:49,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:49,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:49,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:49,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:49,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:49,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635111199] [2023-11-29 06:42:49,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1635111199] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:49,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:49,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:49,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883258732] [2023-11-29 06:42:49,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:49,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:49,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:49,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:49,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:49,177 INFO L87 Difference]: Start difference. First operand 130 states and 187 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:49,452 INFO L93 Difference]: Finished difference Result 270 states and 389 transitions. [2023-11-29 06:42:49,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:42:49,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 173 [2023-11-29 06:42:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:49,456 INFO L225 Difference]: With dead ends: 270 [2023-11-29 06:42:49,456 INFO L226 Difference]: Without dead ends: 141 [2023-11-29 06:42:49,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:42:49,457 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 206 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:49,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 362 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:42:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2023-11-29 06:42:49,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 127. [2023-11-29 06:42:49,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.3333333333333333) internal successors, (136), 102 states have internal predecessors, (136), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 182 transitions. [2023-11-29 06:42:49,467 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 182 transitions. Word has length 173 [2023-11-29 06:42:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:49,468 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 182 transitions. [2023-11-29 06:42:49,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 182 transitions. [2023-11-29 06:42:49,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 06:42:49,471 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:49,471 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:49,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 06:42:49,471 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:49,471 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:49,472 INFO L85 PathProgramCache]: Analyzing trace with hash -464214425, now seen corresponding path program 1 times [2023-11-29 06:42:49,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:49,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389735338] [2023-11-29 06:42:49,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:49,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:49,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:49,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:49,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:49,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:49,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:49,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:49,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:49,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:49,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:49,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:49,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:49,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:49,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:49,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:49,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389735338] [2023-11-29 06:42:49,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389735338] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:49,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:49,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:42:49,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395880558] [2023-11-29 06:42:49,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:49,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:42:49,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:49,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:42:49,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:49,633 INFO L87 Difference]: Start difference. First operand 127 states and 182 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:49,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:49,669 INFO L93 Difference]: Finished difference Result 278 states and 397 transitions. [2023-11-29 06:42:49,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:42:49,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-11-29 06:42:49,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:49,672 INFO L225 Difference]: With dead ends: 278 [2023-11-29 06:42:49,672 INFO L226 Difference]: Without dead ends: 152 [2023-11-29 06:42:49,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:42:49,673 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 50 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:49,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 337 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:42:49,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2023-11-29 06:42:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 127. [2023-11-29 06:42:49,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 102 states have (on average 1.303921568627451) internal successors, (133), 102 states have internal predecessors, (133), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:49,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 179 transitions. [2023-11-29 06:42:49,684 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 179 transitions. Word has length 173 [2023-11-29 06:42:49,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:49,684 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 179 transitions. [2023-11-29 06:42:49,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:49,685 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 179 transitions. [2023-11-29 06:42:49,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:42:49,686 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:49,686 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:49,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 06:42:49,686 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:49,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:49,687 INFO L85 PathProgramCache]: Analyzing trace with hash 884410523, now seen corresponding path program 1 times [2023-11-29 06:42:49,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:49,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721261418] [2023-11-29 06:42:49,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:49,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:50,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:50,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:50,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:50,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:50,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:50,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:50,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:50,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:50,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:50,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:50,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:50,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:50,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:50,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721261418] [2023-11-29 06:42:50,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721261418] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:50,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:50,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 06:42:50,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186514946] [2023-11-29 06:42:50,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:50,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 06:42:50,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:50,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 06:42:50,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:42:50,605 INFO L87 Difference]: Start difference. First operand 127 states and 179 transitions. Second operand has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:51,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:51,026 INFO L93 Difference]: Finished difference Result 411 states and 579 transitions. [2023-11-29 06:42:51,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 06:42:51,027 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:42:51,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:51,030 INFO L225 Difference]: With dead ends: 411 [2023-11-29 06:42:51,030 INFO L226 Difference]: Without dead ends: 285 [2023-11-29 06:42:51,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2023-11-29 06:42:51,032 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 326 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1711 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:51,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1711 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:42:51,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-11-29 06:42:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 160. [2023-11-29 06:42:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 135 states have (on average 1.3111111111111111) internal successors, (177), 135 states have internal predecessors, (177), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 223 transitions. [2023-11-29 06:42:51,054 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 223 transitions. Word has length 175 [2023-11-29 06:42:51,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:51,054 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 223 transitions. [2023-11-29 06:42:51,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:51,055 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 223 transitions. [2023-11-29 06:42:51,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:42:51,057 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:51,058 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:51,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 06:42:51,058 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:51,058 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:51,059 INFO L85 PathProgramCache]: Analyzing trace with hash 491383513, now seen corresponding path program 1 times [2023-11-29 06:42:51,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:51,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480043265] [2023-11-29 06:42:51,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:51,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:51,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:51,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:51,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:51,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:51,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:51,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:51,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:51,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:51,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:51,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:51,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:51,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:51,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:51,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:51,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:51,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480043265] [2023-11-29 06:42:51,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480043265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:51,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:51,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:42:51,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155574884] [2023-11-29 06:42:51,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:51,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:42:51,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:51,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:42:51,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:42:51,311 INFO L87 Difference]: Start difference. First operand 160 states and 223 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:51,360 INFO L93 Difference]: Finished difference Result 357 states and 497 transitions. [2023-11-29 06:42:51,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:42:51,361 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:42:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:51,363 INFO L225 Difference]: With dead ends: 357 [2023-11-29 06:42:51,363 INFO L226 Difference]: Without dead ends: 198 [2023-11-29 06:42:51,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:42:51,364 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 63 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:51,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 447 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:42:51,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-11-29 06:42:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 164. [2023-11-29 06:42:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 139 states have (on average 1.3021582733812949) internal successors, (181), 139 states have internal predecessors, (181), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:51,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 227 transitions. [2023-11-29 06:42:51,381 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 227 transitions. Word has length 175 [2023-11-29 06:42:51,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:51,382 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 227 transitions. [2023-11-29 06:42:51,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 227 transitions. [2023-11-29 06:42:51,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:42:51,384 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:51,385 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:51,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 06:42:51,385 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:51,385 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:51,385 INFO L85 PathProgramCache]: Analyzing trace with hash 749548951, now seen corresponding path program 1 times [2023-11-29 06:42:51,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:51,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725203873] [2023-11-29 06:42:51,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:51,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:51,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:51,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:51,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:51,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:51,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:51,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:51,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:51,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:51,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:51,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:51,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725203873] [2023-11-29 06:42:51,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725203873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:51,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:51,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:51,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919297656] [2023-11-29 06:42:51,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:51,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:51,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:51,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:51,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:51,925 INFO L87 Difference]: Start difference. First operand 164 states and 227 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:52,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:52,098 INFO L93 Difference]: Finished difference Result 413 states and 566 transitions. [2023-11-29 06:42:52,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:42:52,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:42:52,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:52,101 INFO L225 Difference]: With dead ends: 413 [2023-11-29 06:42:52,101 INFO L226 Difference]: Without dead ends: 250 [2023-11-29 06:42:52,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:42:52,102 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 187 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:52,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 563 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:52,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-29 06:42:52,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 209. [2023-11-29 06:42:52,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 177 states have (on average 1.2881355932203389) internal successors, (228), 178 states have internal predecessors, (228), 29 states have call successors, (29), 2 states have call predecessors, (29), 2 states have return successors, (29), 28 states have call predecessors, (29), 29 states have call successors, (29) [2023-11-29 06:42:52,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 286 transitions. [2023-11-29 06:42:52,126 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 286 transitions. Word has length 175 [2023-11-29 06:42:52,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:52,126 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 286 transitions. [2023-11-29 06:42:52,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:52,127 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 286 transitions. [2023-11-29 06:42:52,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:42:52,130 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:52,130 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:52,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 06:42:52,130 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:52,130 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:52,131 INFO L85 PathProgramCache]: Analyzing trace with hash -261568299, now seen corresponding path program 1 times [2023-11-29 06:42:52,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:52,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474985898] [2023-11-29 06:42:52,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:52,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:52,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:52,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:52,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:52,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:52,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:52,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:52,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:52,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:52,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:52,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:52,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:53,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:53,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:53,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:53,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:53,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474985898] [2023-11-29 06:42:53,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474985898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:53,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:53,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:53,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052944615] [2023-11-29 06:42:53,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:53,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:53,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:53,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:53,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:53,017 INFO L87 Difference]: Start difference. First operand 209 states and 286 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:53,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:53,233 INFO L93 Difference]: Finished difference Result 623 states and 844 transitions. [2023-11-29 06:42:53,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:42:53,234 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-11-29 06:42:53,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:53,238 INFO L225 Difference]: With dead ends: 623 [2023-11-29 06:42:53,238 INFO L226 Difference]: Without dead ends: 415 [2023-11-29 06:42:53,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:42:53,240 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 129 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:53,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 657 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:42:53,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-11-29 06:42:53,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 357. [2023-11-29 06:42:53,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 309 states have (on average 1.2750809061488673) internal successors, (394), 312 states have internal predecessors, (394), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2023-11-29 06:42:53,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 480 transitions. [2023-11-29 06:42:53,279 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 480 transitions. Word has length 175 [2023-11-29 06:42:53,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:53,280 INFO L495 AbstractCegarLoop]: Abstraction has 357 states and 480 transitions. [2023-11-29 06:42:53,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:53,280 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 480 transitions. [2023-11-29 06:42:53,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:42:53,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:53,283 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:53,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 06:42:53,283 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:53,284 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:53,284 INFO L85 PathProgramCache]: Analyzing trace with hash 750397017, now seen corresponding path program 1 times [2023-11-29 06:42:53,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:53,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220741548] [2023-11-29 06:42:53,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:53,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:53,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:53,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:53,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:53,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:53,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:53,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:53,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:53,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:53,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:53,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:53,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:53,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:53,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:53,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:53,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220741548] [2023-11-29 06:42:53,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220741548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:53,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:53,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:42:53,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230416336] [2023-11-29 06:42:53,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:53,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:42:53,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:53,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:42:53,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:42:53,476 INFO L87 Difference]: Start difference. First operand 357 states and 480 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:53,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:53,537 INFO L93 Difference]: Finished difference Result 674 states and 910 transitions. [2023-11-29 06:42:53,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:42:53,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:42:53,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:53,541 INFO L225 Difference]: With dead ends: 674 [2023-11-29 06:42:53,541 INFO L226 Difference]: Without dead ends: 318 [2023-11-29 06:42:53,542 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:42:53,543 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 3 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:53,543 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 433 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:42:53,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2023-11-29 06:42:53,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2023-11-29 06:42:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 270 states have (on average 1.2703703703703704) internal successors, (343), 273 states have internal predecessors, (343), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2023-11-29 06:42:53,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 429 transitions. [2023-11-29 06:42:53,582 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 429 transitions. Word has length 175 [2023-11-29 06:42:53,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:53,582 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 429 transitions. [2023-11-29 06:42:53,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:53,583 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 429 transitions. [2023-11-29 06:42:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:42:53,585 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:53,586 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:53,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 06:42:53,586 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:53,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:53,586 INFO L85 PathProgramCache]: Analyzing trace with hash -199528685, now seen corresponding path program 1 times [2023-11-29 06:42:53,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:53,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307450833] [2023-11-29 06:42:53,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:53,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:53,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:54,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:54,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:54,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:54,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:54,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:54,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:54,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:54,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:54,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:54,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:54,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:54,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:54,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:54,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:54,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:54,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:54,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:54,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:54,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307450833] [2023-11-29 06:42:54,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307450833] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:54,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:54,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:54,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736374478] [2023-11-29 06:42:54,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:54,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:54,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:54,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:54,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:54,608 INFO L87 Difference]: Start difference. First operand 318 states and 429 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:54,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:54,832 INFO L93 Difference]: Finished difference Result 894 states and 1206 transitions. [2023-11-29 06:42:54,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 06:42:54,833 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-11-29 06:42:54,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:54,837 INFO L225 Difference]: With dead ends: 894 [2023-11-29 06:42:54,838 INFO L226 Difference]: Without dead ends: 577 [2023-11-29 06:42:54,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:42:54,840 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 134 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:54,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 623 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:54,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2023-11-29 06:42:54,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 407. [2023-11-29 06:42:54,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 359 states have (on average 1.2841225626740946) internal successors, (461), 362 states have internal predecessors, (461), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2023-11-29 06:42:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 547 transitions. [2023-11-29 06:42:54,887 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 547 transitions. Word has length 175 [2023-11-29 06:42:54,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:54,888 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 547 transitions. [2023-11-29 06:42:54,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:54,888 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 547 transitions. [2023-11-29 06:42:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:42:54,891 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:54,891 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:54,891 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 06:42:54,892 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:54,892 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:54,892 INFO L85 PathProgramCache]: Analyzing trace with hash 812436631, now seen corresponding path program 1 times [2023-11-29 06:42:54,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:54,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358722111] [2023-11-29 06:42:54,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:54,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:55,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:55,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:55,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:55,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:55,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:55,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:55,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:55,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:55,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:55,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:55,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:55,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358722111] [2023-11-29 06:42:55,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358722111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:55,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:55,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:55,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472618312] [2023-11-29 06:42:55,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:55,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:55,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:55,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:55,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:55,354 INFO L87 Difference]: Start difference. First operand 407 states and 547 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:55,556 INFO L93 Difference]: Finished difference Result 868 states and 1163 transitions. [2023-11-29 06:42:55,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:42:55,557 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:42:55,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:55,560 INFO L225 Difference]: With dead ends: 868 [2023-11-29 06:42:55,560 INFO L226 Difference]: Without dead ends: 462 [2023-11-29 06:42:55,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-11-29 06:42:55,562 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 78 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:55,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 682 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:55,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2023-11-29 06:42:55,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 382. [2023-11-29 06:42:55,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 334 states have (on average 1.2754491017964071) internal successors, (426), 337 states have internal predecessors, (426), 43 states have call successors, (43), 4 states have call predecessors, (43), 4 states have return successors, (43), 40 states have call predecessors, (43), 43 states have call successors, (43) [2023-11-29 06:42:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 512 transitions. [2023-11-29 06:42:55,606 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 512 transitions. Word has length 175 [2023-11-29 06:42:55,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:55,606 INFO L495 AbstractCegarLoop]: Abstraction has 382 states and 512 transitions. [2023-11-29 06:42:55,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 512 transitions. [2023-11-29 06:42:55,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:42:55,609 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:55,610 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:55,610 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 06:42:55,610 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:55,610 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash -709001775, now seen corresponding path program 1 times [2023-11-29 06:42:55,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:55,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485915237] [2023-11-29 06:42:55,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:55,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:55,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:55,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:56,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:56,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:56,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:56,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:56,038 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:56,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:56,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485915237] [2023-11-29 06:42:56,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485915237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:56,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:56,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:56,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870651616] [2023-11-29 06:42:56,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:56,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:56,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:56,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:56,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:56,041 INFO L87 Difference]: Start difference. First operand 382 states and 512 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:56,245 INFO L93 Difference]: Finished difference Result 808 states and 1077 transitions. [2023-11-29 06:42:56,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:42:56,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:42:56,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:56,249 INFO L225 Difference]: With dead ends: 808 [2023-11-29 06:42:56,249 INFO L226 Difference]: Without dead ends: 427 [2023-11-29 06:42:56,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:42:56,251 INFO L413 NwaCegarLoop]: 197 mSDtfsCounter, 141 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:56,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 703 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:56,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-11-29 06:42:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 281. [2023-11-29 06:42:56,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 245 states have (on average 1.2653061224489797) internal successors, (310), 246 states have internal predecessors, (310), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 06:42:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 372 transitions. [2023-11-29 06:42:56,286 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 372 transitions. Word has length 175 [2023-11-29 06:42:56,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:56,287 INFO L495 AbstractCegarLoop]: Abstraction has 281 states and 372 transitions. [2023-11-29 06:42:56,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:56,287 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 372 transitions. [2023-11-29 06:42:56,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:42:56,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:56,290 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:56,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 06:42:56,290 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:56,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:56,291 INFO L85 PathProgramCache]: Analyzing trace with hash 302963541, now seen corresponding path program 1 times [2023-11-29 06:42:56,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:56,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044498618] [2023-11-29 06:42:56,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:56,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:57,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:57,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:57,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:57,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:57,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:57,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:57,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:57,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:57,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:57,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:57,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:57,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:57,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:57,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044498618] [2023-11-29 06:42:57,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044498618] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:57,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:57,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:57,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055687622] [2023-11-29 06:42:57,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:57,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:57,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:57,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:57,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:57,087 INFO L87 Difference]: Start difference. First operand 281 states and 372 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:57,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:57,293 INFO L93 Difference]: Finished difference Result 633 states and 837 transitions. [2023-11-29 06:42:57,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:42:57,294 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-11-29 06:42:57,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:57,297 INFO L225 Difference]: With dead ends: 633 [2023-11-29 06:42:57,297 INFO L226 Difference]: Without dead ends: 353 [2023-11-29 06:42:57,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:42:57,298 INFO L413 NwaCegarLoop]: 194 mSDtfsCounter, 117 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:57,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 674 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:57,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2023-11-29 06:42:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 279. [2023-11-29 06:42:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 243 states have (on average 1.2551440329218106) internal successors, (305), 244 states have internal predecessors, (305), 31 states have call successors, (31), 4 states have call predecessors, (31), 4 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2023-11-29 06:42:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 367 transitions. [2023-11-29 06:42:57,330 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 367 transitions. Word has length 175 [2023-11-29 06:42:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:57,331 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 367 transitions. [2023-11-29 06:42:57,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 367 transitions. [2023-11-29 06:42:57,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:42:57,333 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:57,334 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:57,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 06:42:57,334 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:57,334 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:57,334 INFO L85 PathProgramCache]: Analyzing trace with hash -708153709, now seen corresponding path program 1 times [2023-11-29 06:42:57,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:57,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967074032] [2023-11-29 06:42:57,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:57,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:58,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:58,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:58,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:58,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:58,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:58,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967074032] [2023-11-29 06:42:58,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967074032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:58,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:58,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:58,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139576743] [2023-11-29 06:42:58,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:58,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:58,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:58,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:58,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:58,097 INFO L87 Difference]: Start difference. First operand 279 states and 367 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:58,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:58,275 INFO L93 Difference]: Finished difference Result 562 states and 736 transitions. [2023-11-29 06:42:58,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:42:58,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 175 [2023-11-29 06:42:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:58,278 INFO L225 Difference]: With dead ends: 562 [2023-11-29 06:42:58,278 INFO L226 Difference]: Without dead ends: 284 [2023-11-29 06:42:58,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:42:58,279 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 69 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:58,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 808 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:58,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-11-29 06:42:58,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 236. [2023-11-29 06:42:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 209 states have (on average 1.2535885167464116) internal successors, (262), 209 states have internal predecessors, (262), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 308 transitions. [2023-11-29 06:42:58,297 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 308 transitions. Word has length 175 [2023-11-29 06:42:58,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:58,297 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 308 transitions. [2023-11-29 06:42:58,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:42:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 308 transitions. [2023-11-29 06:42:58,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:42:58,299 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:58,299 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:58,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 06:42:58,299 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:58,299 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:58,299 INFO L85 PathProgramCache]: Analyzing trace with hash -449988271, now seen corresponding path program 1 times [2023-11-29 06:42:58,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:58,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722923801] [2023-11-29 06:42:58,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:58,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:58,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:42:58,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:42:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:42:58,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:42:58,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:42:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:42:58,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:42:58,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:42:58,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:42:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:42:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:42:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:42:58,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:42:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:42:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:42:58,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:42:58,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:42:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:42:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:42:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:42:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:42:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:42:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:42:58,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:42:58,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:42:58,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:42:58,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722923801] [2023-11-29 06:42:58,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722923801] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:42:58,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:42:58,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:42:58,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126371359] [2023-11-29 06:42:58,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:42:58,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:42:58,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:42:58,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:42:58,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:42:58,579 INFO L87 Difference]: Start difference. First operand 236 states and 308 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:58,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:42:58,726 INFO L93 Difference]: Finished difference Result 535 states and 700 transitions. [2023-11-29 06:42:58,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:42:58,727 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:42:58,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:42:58,729 INFO L225 Difference]: With dead ends: 535 [2023-11-29 06:42:58,729 INFO L226 Difference]: Without dead ends: 300 [2023-11-29 06:42:58,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:42:58,731 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 121 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:42:58,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 695 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:42:58,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-11-29 06:42:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 236. [2023-11-29 06:42:58,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 209 states have (on average 1.2488038277511961) internal successors, (261), 209 states have internal predecessors, (261), 23 states have call successors, (23), 3 states have call predecessors, (23), 3 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:42:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 307 transitions. [2023-11-29 06:42:58,747 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 307 transitions. Word has length 175 [2023-11-29 06:42:58,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:42:58,747 INFO L495 AbstractCegarLoop]: Abstraction has 236 states and 307 transitions. [2023-11-29 06:42:58,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:42:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 307 transitions. [2023-11-29 06:42:58,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:42:58,749 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:42:58,749 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:42:58,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 06:42:58,749 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:42:58,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:42:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash -843015281, now seen corresponding path program 1 times [2023-11-29 06:42:58,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:42:58,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173906566] [2023-11-29 06:42:58,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:42:58,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:42:58,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:43:00,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:43:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:43:00,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:43:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:43:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:43:00,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:43:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:43:00,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:43:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:43:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:43:00,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:43:00,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:43:00,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:43:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:43:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:43:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:43:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:43:00,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:43:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:43:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:43:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:43:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:43:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:00,486 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:00,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:00,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173906566] [2023-11-29 06:43:00,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173906566] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:00,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:00,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 06:43:00,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573524209] [2023-11-29 06:43:00,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:00,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:43:00,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:00,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:43:00,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:43:00,489 INFO L87 Difference]: Start difference. First operand 236 states and 307 transitions. Second operand has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2023-11-29 06:43:01,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:01,190 INFO L93 Difference]: Finished difference Result 514 states and 671 transitions. [2023-11-29 06:43:01,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 06:43:01,191 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) Word has length 175 [2023-11-29 06:43:01,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:01,193 INFO L225 Difference]: With dead ends: 514 [2023-11-29 06:43:01,193 INFO L226 Difference]: Without dead ends: 279 [2023-11-29 06:43:01,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2023-11-29 06:43:01,195 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 155 mSDsluCounter, 1561 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1764 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:01,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1764 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:43:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2023-11-29 06:43:01,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 265. [2023-11-29 06:43:01,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 233 states have (on average 1.2532188841201717) internal successors, (292), 234 states have internal predecessors, (292), 27 states have call successors, (27), 4 states have call predecessors, (27), 4 states have return successors, (27), 26 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-29 06:43:01,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 346 transitions. [2023-11-29 06:43:01,229 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 346 transitions. Word has length 175 [2023-11-29 06:43:01,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:01,229 INFO L495 AbstractCegarLoop]: Abstraction has 265 states and 346 transitions. [2023-11-29 06:43:01,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 7.0) internal successors, (63), 11 states have internal predecessors, (63), 3 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 3 states have call successors, (23) [2023-11-29 06:43:01,230 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 346 transitions. [2023-11-29 06:43:01,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:43:01,232 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:01,232 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:01,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 06:43:01,232 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:01,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:01,233 INFO L85 PathProgramCache]: Analyzing trace with hash -788525182, now seen corresponding path program 1 times [2023-11-29 06:43:01,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:01,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881117616] [2023-11-29 06:43:01,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:01,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:01,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:43:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:43:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:43:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:43:01,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:43:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:43:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:43:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:43:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:43:01,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:43:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:43:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:43:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:43:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:43:01,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:43:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:43:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:43:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:43:01,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:43:01,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:43:01,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:43:01,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:43:01,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:43:01,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:01,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:01,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881117616] [2023-11-29 06:43:01,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881117616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:01,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:01,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:43:01,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180370799] [2023-11-29 06:43:01,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:01,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:43:01,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:01,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:43:01,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:43:01,533 INFO L87 Difference]: Start difference. First operand 265 states and 346 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:01,735 INFO L93 Difference]: Finished difference Result 704 states and 917 transitions. [2023-11-29 06:43:01,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:43:01,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:43:01,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:01,739 INFO L225 Difference]: With dead ends: 704 [2023-11-29 06:43:01,740 INFO L226 Difference]: Without dead ends: 440 [2023-11-29 06:43:01,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:43:01,741 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 109 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:01,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 406 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:43:01,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2023-11-29 06:43:01,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 332. [2023-11-29 06:43:01,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 274 states have (on average 1.2262773722627738) internal successors, (336), 275 states have internal predecessors, (336), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 06:43:01,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 436 transitions. [2023-11-29 06:43:01,781 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 436 transitions. Word has length 175 [2023-11-29 06:43:01,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:01,782 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 436 transitions. [2023-11-29 06:43:01,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:01,782 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 436 transitions. [2023-11-29 06:43:01,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-11-29 06:43:01,783 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:01,784 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:01,784 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2023-11-29 06:43:01,784 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:01,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:01,785 INFO L85 PathProgramCache]: Analyzing trace with hash 816954960, now seen corresponding path program 1 times [2023-11-29 06:43:01,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:01,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356879403] [2023-11-29 06:43:01,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:01,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:43:01,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:43:01,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:43:01,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:43:01,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:43:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:43:01,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:43:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:43:01,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:43:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:43:01,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:43:01,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:43:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:43:01,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:43:01,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:43:01,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:43:01,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:43:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:43:01,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:43:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:43:01,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:43:01,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:43:01,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:43:01,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:01,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:01,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:01,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356879403] [2023-11-29 06:43:01,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356879403] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:01,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:01,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:43:01,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784665690] [2023-11-29 06:43:01,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:01,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:43:01,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:01,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:43:01,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:43:01,978 INFO L87 Difference]: Start difference. First operand 332 states and 436 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:02,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:02,047 INFO L93 Difference]: Finished difference Result 608 states and 797 transitions. [2023-11-29 06:43:02,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:43:02,047 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2023-11-29 06:43:02,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:02,050 INFO L225 Difference]: With dead ends: 608 [2023-11-29 06:43:02,050 INFO L226 Difference]: Without dead ends: 344 [2023-11-29 06:43:02,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:43:02,052 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 24 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:02,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 567 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:43:02,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-11-29 06:43:02,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 338. [2023-11-29 06:43:02,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 280 states have (on average 1.2214285714285715) internal successors, (342), 281 states have internal predecessors, (342), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 06:43:02,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 442 transitions. [2023-11-29 06:43:02,090 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 442 transitions. Word has length 177 [2023-11-29 06:43:02,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:02,090 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 442 transitions. [2023-11-29 06:43:02,090 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:02,090 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 442 transitions. [2023-11-29 06:43:02,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 06:43:02,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:02,092 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:02,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 06:43:02,092 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:02,093 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:02,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1212426507, now seen corresponding path program 1 times [2023-11-29 06:43:02,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:02,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851679439] [2023-11-29 06:43:02,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:02,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:02,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-29 06:43:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2023-11-29 06:43:02,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-29 06:43:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-29 06:43:02,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-29 06:43:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 06:43:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-29 06:43:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 06:43:02,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 06:43:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 06:43:02,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 06:43:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 06:43:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 06:43:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-29 06:43:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-29 06:43:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 06:43:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-29 06:43:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-29 06:43:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 06:43:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 06:43:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 06:43:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-29 06:43:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 06:43:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:02,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:02,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 06:43:02,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851679439] [2023-11-29 06:43:02,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851679439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:02,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:02,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:43:02,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439619075] [2023-11-29 06:43:02,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:02,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:43:02,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 06:43:02,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:43:02,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:43:02,566 INFO L87 Difference]: Start difference. First operand 338 states and 442 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:02,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:02,731 INFO L93 Difference]: Finished difference Result 596 states and 772 transitions. [2023-11-29 06:43:02,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 06:43:02,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2023-11-29 06:43:02,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:02,736 INFO L225 Difference]: With dead ends: 596 [2023-11-29 06:43:02,736 INFO L226 Difference]: Without dead ends: 594 [2023-11-29 06:43:02,736 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:43:02,737 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 95 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:02,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 877 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:43:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2023-11-29 06:43:02,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 591. [2023-11-29 06:43:02,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 510 states have (on average 1.2294117647058824) internal successors, (627), 513 states have internal predecessors, (627), 69 states have call successors, (69), 11 states have call predecessors, (69), 11 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2023-11-29 06:43:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 765 transitions. [2023-11-29 06:43:02,777 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 765 transitions. Word has length 179 [2023-11-29 06:43:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:02,777 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 765 transitions. [2023-11-29 06:43:02,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 765 transitions. [2023-11-29 06:43:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 06:43:02,779 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:02,779 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:02,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 06:43:02,779 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:02,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:02,779 INFO L85 PathProgramCache]: Analyzing trace with hash 838557491, now seen corresponding path program 1 times [2023-11-29 06:43:02,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 06:43:02,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560673862] [2023-11-29 06:43:02,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:02,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 06:43:02,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:43:02,875 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 06:43:02,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 06:43:02,995 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 06:43:02,995 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 06:43:02,996 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-29 06:43:02,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 06:43:03,002 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 06:43:03,006 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 06:43:03,058 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated [2023-11-29 06:43:03,060 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated [2023-11-29 06:43:03,061 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated [2023-11-29 06:43:03,062 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated [2023-11-29 06:43:03,063 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated [2023-11-29 06:43:03,064 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated [2023-11-29 06:43:03,065 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated [2023-11-29 06:43:03,065 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated [2023-11-29 06:43:03,066 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated [2023-11-29 06:43:03,067 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated [2023-11-29 06:43:03,067 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-11-29 06:43:03,068 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-11-29 06:43:03,068 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-29 06:43:03,069 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated [2023-11-29 06:43:03,069 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-11-29 06:43:03,069 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-29 06:43:03,069 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short55 could not be translated [2023-11-29 06:43:03,070 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated [2023-11-29 06:43:03,070 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated [2023-11-29 06:43:03,070 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated [2023-11-29 06:43:03,070 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short55 could not be translated [2023-11-29 06:43:03,071 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated [2023-11-29 06:43:03,072 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated [2023-11-29 06:43:03,073 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated [2023-11-29 06:43:03,073 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated [2023-11-29 06:43:03,074 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated [2023-11-29 06:43:03,075 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated [2023-11-29 06:43:03,076 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated [2023-11-29 06:43:03,076 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated [2023-11-29 06:43:03,077 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem69 could not be translated [2023-11-29 06:43:03,077 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated [2023-11-29 06:43:03,078 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated [2023-11-29 06:43:03,079 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated [2023-11-29 06:43:03,079 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short14 could not be translated [2023-11-29 06:43:03,079 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated [2023-11-29 06:43:03,080 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 06:43:03,080 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-29 06:43:03,080 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated [2023-11-29 06:43:03,080 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated [2023-11-29 06:43:03,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated [2023-11-29 06:43:03,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite27 could not be translated [2023-11-29 06:43:03,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem26 could not be translated [2023-11-29 06:43:03,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem23 could not be translated [2023-11-29 06:43:03,081 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem24 could not be translated [2023-11-29 06:43:03,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem25 could not be translated [2023-11-29 06:43:03,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 06:43:03,082 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 06:43:03,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 06:43:03,083 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 06:43:03,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 06:43:03,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 06:43:03,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 06:43:03,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 06:43:03,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 06:43:03,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,084 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 06:43:03,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 06:43:03,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 06:43:03,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 06:43:03,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 06:43:03,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 06:43:03,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 06:43:03,085 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 06:43:03,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 06:43:03,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 06:43:03,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 06:43:03,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 06:43:03,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 06:43:03,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 06:43:03,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 06:43:03,086 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 06:43:03,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 06:43:03,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 06:43:03,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 06:43:03,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 06:43:03,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 06:43:03,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 06:43:03,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 06:43:03,087 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 06:43:03,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 06:43:03,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 06:43:03,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 06:43:03,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 06:43:03,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 06:43:03,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 06:43:03,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 06:43:03,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 06:43:03,088 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 06:43:03,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 06:43:03,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 06:43:03,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 06:43:03,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 06:43:03,089 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 06:43:03,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 06:43:03,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 06:43:03,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 06:43:03,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 06:43:03,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 06:43:03,090 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 06:43:03,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 06:43:03,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 06:43:03,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 06:43:03,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 06:43:03,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 06:43:03,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 06:43:03,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 06:43:03,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 06:43:03,091 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 06:43:03,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 06:43:03,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 06:43:03,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 06:43:03,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 06:43:03,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 06:43:03,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated [2023-11-29 06:43:03,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 06:43:03,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 06:43:03,092 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 06:43:03,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 06:43:03,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 06:43:03,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 06:43:03,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 06:43:03,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 06:43:03,093 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-29 06:43:03,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite117 could not be translated [2023-11-29 06:43:03,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 06:43:03,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 06:43:03,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated [2023-11-29 06:43:03,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 06:43:03,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 06:43:03,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 06:43:03,094 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 06:43:03,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated [2023-11-29 06:43:03,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated [2023-11-29 06:43:03,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 06:43:03,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 06:43:03,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 06:43:03,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem115 could not be translated [2023-11-29 06:43:03,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 06:43:03,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated [2023-11-29 06:43:03,095 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 06:43:03,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated [2023-11-29 06:43:03,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated [2023-11-29 06:43:03,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated [2023-11-29 06:43:03,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite117 could not be translated [2023-11-29 06:43:03,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated [2023-11-29 06:43:03,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated [2023-11-29 06:43:03,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated [2023-11-29 06:43:03,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated [2023-11-29 06:43:03,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated [2023-11-29 06:43:03,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated [2023-11-29 06:43:03,096 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem115 could not be translated [2023-11-29 06:43:03,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated [2023-11-29 06:43:03,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated [2023-11-29 06:43:03,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated [2023-11-29 06:43:03,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated [2023-11-29 06:43:03,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated [2023-11-29 06:43:03,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated [2023-11-29 06:43:03,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated [2023-11-29 06:43:03,097 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated [2023-11-29 06:43:03,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 06:43:03 BoogieIcfgContainer [2023-11-29 06:43:03,121 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 06:43:03,121 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 06:43:03,122 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 06:43:03,122 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 06:43:03,122 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:42:45" (3/4) ... [2023-11-29 06:43:03,124 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 06:43:03,126 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 06:43:03,126 INFO L158 Benchmark]: Toolchain (without parser) took 18734.62ms. Allocated memory was 136.3MB in the beginning and 520.1MB in the end (delta: 383.8MB). Free memory was 98.3MB in the beginning and 203.2MB in the end (delta: -104.9MB). Peak memory consumption was 280.6MB. Max. memory is 16.1GB. [2023-11-29 06:43:03,127 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 98.6MB. Free memory was 44.8MB in the beginning and 44.7MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:43:03,127 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.23ms. Allocated memory is still 136.3MB. Free memory was 98.0MB in the beginning and 83.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 06:43:03,127 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.91ms. Allocated memory is still 136.3MB. Free memory was 83.7MB in the beginning and 79.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:43:03,128 INFO L158 Benchmark]: Boogie Preprocessor took 86.67ms. Allocated memory is still 136.3MB. Free memory was 79.5MB in the beginning and 75.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 06:43:03,128 INFO L158 Benchmark]: RCFGBuilder took 733.26ms. Allocated memory was 136.3MB in the beginning and 205.5MB in the end (delta: 69.2MB). Free memory was 75.3MB in the beginning and 166.2MB in the end (delta: -90.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2023-11-29 06:43:03,128 INFO L158 Benchmark]: TraceAbstraction took 17535.01ms. Allocated memory was 205.5MB in the beginning and 520.1MB in the end (delta: 314.6MB). Free memory was 166.2MB in the beginning and 203.2MB in the end (delta: -37.0MB). Peak memory consumption was 276.5MB. Max. memory is 16.1GB. [2023-11-29 06:43:03,129 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 520.1MB. Free memory is still 203.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 06:43:03,131 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.18ms. Allocated memory is still 98.6MB. Free memory was 44.8MB in the beginning and 44.7MB in the end (delta: 142.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 297.23ms. Allocated memory is still 136.3MB. Free memory was 98.0MB in the beginning and 83.7MB in the end (delta: 14.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.91ms. Allocated memory is still 136.3MB. Free memory was 83.7MB in the beginning and 79.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.67ms. Allocated memory is still 136.3MB. Free memory was 79.5MB in the beginning and 75.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 733.26ms. Allocated memory was 136.3MB in the beginning and 205.5MB in the end (delta: 69.2MB). Free memory was 75.3MB in the beginning and 166.2MB in the end (delta: -90.9MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 17535.01ms. Allocated memory was 205.5MB in the beginning and 520.1MB in the end (delta: 314.6MB). Free memory was 166.2MB in the beginning and 203.2MB in the end (delta: -37.0MB). Peak memory consumption was 276.5MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 520.1MB. Free memory is still 203.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem34 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem35 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem37 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem38 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem40 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem41 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem43 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem44 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem46 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem47 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem49 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem50 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short51 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short55 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem57 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem58 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem60 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem61 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem63 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem64 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem66 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem67 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem69 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem70 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem72 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem73 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short14 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem13 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short17 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem15 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short19 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite27 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem26 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem23 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem24 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem25 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite110 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem90 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short89 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite117 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem97 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem85 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite95 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short118 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short111 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem114 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem115 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem113 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short87 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem83 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem112 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~ite81 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short84 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~short96 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~mem116 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 1}, {0, 0, 1} }; [L25-L27] double double_Array_0[2] = { 10.6, 16.6 }; [L25-L27] double double_Array_0[2] = { 10.6, 16.6 }; [L25-L27] double double_Array_0[2] = { 10.6, 16.6 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L28-L30] signed char signed_char_Array_0[5] = { 10, 4, 64, -4, 32 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L31-L33] unsigned char unsigned_char_Array_0[3] = { 64, 100, 100 }; [L34] unsigned char last_1_BOOL_unsigned_char_Array_0_1__1_ = 0; [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] CALL updateLastVariables() [L99] EXPR BOOL_unsigned_char_Array_0[1][1] [L99] last_1_BOOL_unsigned_char_Array_0_1__1_ = BOOL_unsigned_char_Array_0[1][1] [L109] RET updateLastVariables() [L110] CALL updateVariables() [L62] BOOL_unsigned_char_Array_0[0][0] = __VERIFIER_nondet_uchar() [L63] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L63] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] EXPR BOOL_unsigned_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L64] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L65] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L66] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L66] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L67] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L68] BOOL_unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L69] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L69] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][1] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L71] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L72] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L72] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[0][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L74] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L75] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L75] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L76] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][2] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L77] double_Array_0[0] = __VERIFIER_nondet_double() [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F [L78] EXPR double_Array_0[0] [L78] EXPR double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] EXPR (double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] CALL assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L78] RET assume_abort_if_not((double_Array_0[0] >= -922337.2036854765600e+13F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854765600e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L79] signed_char_Array_0[1] = __VERIFIER_nondet_char() [L80] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] CALL assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L80] RET assume_abort_if_not(signed_char_Array_0[1] >= -127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] EXPR signed_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] CALL assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L81] RET assume_abort_if_not(signed_char_Array_0[1] <= 126) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L82] signed_char_Array_0[3] = __VERIFIER_nondet_char() [L83] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] CALL assume_abort_if_not(signed_char_Array_0[3] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L83] RET assume_abort_if_not(signed_char_Array_0[3] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] EXPR signed_char_Array_0[3] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] CALL assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L84] RET assume_abort_if_not(signed_char_Array_0[3] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L85] signed_char_Array_0[4] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[4] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[4] >= -63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] EXPR signed_char_Array_0[4] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[4] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[4] <= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L88] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L89] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L89] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 64) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L90] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L91] unsigned_char_Array_0[1] = __VERIFIER_nondet_uchar() [L92] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] CALL assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L92] RET assume_abort_if_not(unsigned_char_Array_0[1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] CALL assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L93] RET assume_abort_if_not(unsigned_char_Array_0[1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L94] unsigned_char_Array_0[2] = __VERIFIER_nondet_uchar() [L95] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] CALL assume_abort_if_not(unsigned_char_Array_0[2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L95] RET assume_abort_if_not(unsigned_char_Array_0[2] >= 63) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] EXPR unsigned_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] CALL assume_abort_if_not(unsigned_char_Array_0[2] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, cond=1, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L96] RET assume_abort_if_not(unsigned_char_Array_0[2] <= 128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L110] RET updateVariables() [L111] CALL step() [L38] COND FALSE !(\read(last_1_BOOL_unsigned_char_Array_0_1__1_)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L43] EXPR double_Array_0[1] [L43] EXPR double_Array_0[0] [L43] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L43] COND FALSE !(double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) [L46] EXPR BOOL_unsigned_char_Array_0[0][2] [L46] BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L46] BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L46] COND TRUE BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) [L47] EXPR BOOL_unsigned_char_Array_0[1][2] [L47] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L47] BOOL_unsigned_char_Array_0[1][1] = ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]) [L51] EXPR unsigned_char_Array_0[2] [L51] EXPR unsigned_char_Array_0[0] [L51] EXPR unsigned_char_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L51] EXPR ((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1) [L51] EXPR unsigned_char_Array_0[1] [L51] EXPR ((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L51] signed long int stepLocal_1 = (unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1))); [L52] EXPR signed_char_Array_0[2] [L52] signed char stepLocal_0 = signed_char_Array_0[2]; [L53] COND FALSE !(-10 >= stepLocal_0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L111] RET step() [L112] CALL, EXPR property() [L102] EXPR last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1 [L102] EXPR last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0])))))) [L102] EXPR BOOL_unsigned_char_Array_0[0][2] [L102] EXPR BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4)) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))) [L102] EXPR BOOL_unsigned_char_Array_0[1][1] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0])))))) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1) [L102] EXPR signed_char_Array_0[2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1 [L102] EXPR (-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR ((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) [L102] EXPR double_Array_0[1] [L102] EXPR double_Array_0[0] [L102] EXPR double_Array_0[1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1 [L102] EXPR signed_char_Array_0[2] [L102] EXPR signed_char_Array_0[4] [L102] EXPR (double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102] EXPR (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L102-L103] return (((last_1_BOOL_unsigned_char_Array_0_1__1_ ? (last_1_BOOL_unsigned_char_Array_0_1__1_ ? (double_Array_0[1] == ((double) ((((double_Array_0[0]) < 0 ) ? -(double_Array_0[0]) : (double_Array_0[0]))))) : 1) : 1) && ((BOOL_unsigned_char_Array_0[0][2] || (256 >= (signed_char_Array_0[2] + 4))) ? (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) ((BOOL_unsigned_char_Array_0[1][2] || BOOL_unsigned_char_Array_0[0][2]) || BOOL_unsigned_char_Array_0[0][1]))) : (BOOL_unsigned_char_Array_0[1][1] == ((unsigned char) (! (! (BOOL_unsigned_char_Array_0[1][0] || BOOL_unsigned_char_Array_0[0][0]))))))) && ((-10 >= signed_char_Array_0[2]) ? ((((unsigned_char_Array_0[2] + unsigned_char_Array_0[0]) - ((((unsigned_char_Array_0[1]) < (1)) ? (unsigned_char_Array_0[1]) : (1)))) > (~ signed_char_Array_0[2])) ? (signed_char_Array_0[0] == ((signed char) (signed_char_Array_0[3] + signed_char_Array_0[4]))) : (signed_char_Array_0[0] == ((signed char) signed_char_Array_0[1]))) : 1)) && ((double_Array_0[1] >= (- (double_Array_0[0] * double_Array_0[1]))) ? (signed_char_Array_0[2] == ((signed char) signed_char_Array_0[4])) : 1) ; [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=0, cond=0, double_Array_0={5:0}, isInitial=1, last_1_BOOL_unsigned_char_Array_0_1__1_=0, signed_char_Array_0={6:0}, unsigned_char_Array_0={7:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 113 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 17.4s, OverallIterations: 25, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2368 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2361 mSDsluCounter, 14634 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10634 mSDsCounter, 409 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2040 IncrementalHoareTripleChecker+Invalid, 2449 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 409 mSolverCounterUnsat, 4000 mSDtfsCounter, 2040 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1321 GetRequests, 1199 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=24, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 24 MinimizatonAttempts, 1082 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 4330 NumberOfCodeBlocks, 4330 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 4127 ConstructedInterpolants, 0 QuantifiedInterpolants, 7769 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 24288/24288 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-29 06:43:03,169 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/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_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/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 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 06:43:05,120 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 06:43:05,198 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-11-29 06:43:05,204 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 06:43:05,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 06:43:05,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 06:43:05,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 06:43:05,233 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 06:43:05,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 06:43:05,235 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 06:43:05,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 06:43:05,236 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 06:43:05,237 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 06:43:05,237 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 06:43:05,238 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 06:43:05,239 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 06:43:05,239 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 06:43:05,240 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 06:43:05,240 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 06:43:05,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 06:43:05,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 06:43:05,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 06:43:05,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 06:43:05,242 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 06:43:05,243 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 06:43:05,243 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 06:43:05,243 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 06:43:05,244 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 06:43:05,244 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 06:43:05,245 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 06:43:05,245 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 06:43:05,245 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 06:43:05,246 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 06:43:05,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:43:05,246 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 06:43:05,247 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 06:43:05,247 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 06:43:05,247 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 06:43:05,247 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 06:43:05,248 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 06:43:05,248 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 06:43:05,248 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 06:43:05,248 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 06:43:05,249 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 06:43:05,249 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 06:43:05,249 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_f47e9309-b35f-49ba-ad96-cd629ceb9113/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_f47e9309-b35f-49ba-ad96-cd629ceb9113/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 -> 13746df1a3970e1622f02d2f93a14bca6db6fbfac535cca3dbaecdc2ea14baae [2023-11-29 06:43:05,546 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 06:43:05,565 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 06:43:05,568 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 06:43:05,569 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 06:43:05,570 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 06:43:05,571 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2023-11-29 06:43:08,408 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 06:43:08,623 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 06:43:08,624 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i [2023-11-29 06:43:08,635 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/data/32d3f9685/062441d709aa4773a481bd825f5302bd/FLAG2cc4be9c6 [2023-11-29 06:43:08,655 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/data/32d3f9685/062441d709aa4773a481bd825f5302bd [2023-11-29 06:43:08,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 06:43:08,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 06:43:08,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 06:43:08,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 06:43:08,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 06:43:08,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:43:08" (1/1) ... [2023-11-29 06:43:08,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@175fc1eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:08, skipping insertion in model container [2023-11-29 06:43:08,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 06:43:08" (1/1) ... [2023-11-29 06:43:08,703 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 06:43:08,864 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_f47e9309-b35f-49ba-ad96-cd629ceb9113/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i[916,929] [2023-11-29 06:43:08,931 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:43:08,948 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 06:43:08,958 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_f47e9309-b35f-49ba-ad96-cd629ceb9113/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-34.i[916,929] [2023-11-29 06:43:09,016 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 06:43:09,051 INFO L206 MainTranslator]: Completed translation [2023-11-29 06:43:09,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09 WrapperNode [2023-11-29 06:43:09,052 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 06:43:09,054 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 06:43:09,054 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 06:43:09,054 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 06:43:09,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (1/1) ... [2023-11-29 06:43:09,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (1/1) ... [2023-11-29 06:43:09,128 INFO L138 Inliner]: procedures = 30, calls = 153, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 394 [2023-11-29 06:43:09,128 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 06:43:09,129 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 06:43:09,129 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 06:43:09,130 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 06:43:09,141 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (1/1) ... [2023-11-29 06:43:09,141 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (1/1) ... [2023-11-29 06:43:09,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (1/1) ... [2023-11-29 06:43:09,173 INFO L175 MemorySlicer]: Split 115 memory accesses to 5 slices as follows [2, 38, 21, 34, 20]. 33 percent of accesses are in the largest equivalence class. The 18 initializations are split as follows [2, 6, 2, 5, 3]. The 18 writes are split as follows [0, 7, 2, 6, 3]. [2023-11-29 06:43:09,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (1/1) ... [2023-11-29 06:43:09,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (1/1) ... [2023-11-29 06:43:09,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (1/1) ... [2023-11-29 06:43:09,208 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (1/1) ... [2023-11-29 06:43:09,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (1/1) ... [2023-11-29 06:43:09,217 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (1/1) ... [2023-11-29 06:43:09,225 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 06:43:09,226 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 06:43:09,226 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 06:43:09,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 06:43:09,227 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (1/1) ... [2023-11-29 06:43:09,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 06:43:09,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 06:43:09,254 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 06:43:09,268 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 06:43:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 06:43:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2023-11-29 06:43:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2023-11-29 06:43:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2023-11-29 06:43:09,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2023-11-29 06:43:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2023-11-29 06:43:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2023-11-29 06:43:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2023-11-29 06:43:09,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2023-11-29 06:43:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2023-11-29 06:43:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2023-11-29 06:43:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2023-11-29 06:43:09,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2023-11-29 06:43:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2023-11-29 06:43:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2023-11-29 06:43:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2023-11-29 06:43:09,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 06:43:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 06:43:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 06:43:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 06:43:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 06:43:09,299 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2023-11-29 06:43:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2023-11-29 06:43:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2023-11-29 06:43:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2023-11-29 06:43:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2023-11-29 06:43:09,300 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-29 06:43:09,301 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-29 06:43:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 06:43:09,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 06:43:09,301 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2023-11-29 06:43:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2023-11-29 06:43:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2023-11-29 06:43:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2023-11-29 06:43:09,302 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2023-11-29 06:43:09,448 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 06:43:09,450 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 06:43:24,992 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 06:43:25,051 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 06:43:25,052 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 06:43:25,052 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:43:25 BoogieIcfgContainer [2023-11-29 06:43:25,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 06:43:25,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 06:43:25,055 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 06:43:25,058 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 06:43:25,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 06:43:08" (1/3) ... [2023-11-29 06:43:25,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5769a4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:43:25, skipping insertion in model container [2023-11-29 06:43:25,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 06:43:09" (2/3) ... [2023-11-29 06:43:25,059 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5769a4b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 06:43:25, skipping insertion in model container [2023-11-29 06:43:25,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 06:43:25" (3/3) ... [2023-11-29 06:43:25,061 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-34.i [2023-11-29 06:43:25,075 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 06:43:25,076 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-29 06:43:25,121 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 06:43:25,126 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;@1abc6fbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 06:43:25,127 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-29 06:43:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:43:25,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 06:43:25,147 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:25,148 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:25,148 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:25,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:25,153 INFO L85 PathProgramCache]: Analyzing trace with hash 370900315, now seen corresponding path program 1 times [2023-11-29 06:43:25,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:25,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374822159] [2023-11-29 06:43:25,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:25,166 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:25,166 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:25,167 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:25,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-29 06:43:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:25,720 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjunts are in the unsatisfiable core [2023-11-29 06:43:25,734 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2023-11-29 06:43:25,782 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:25,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:25,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374822159] [2023-11-29 06:43:25,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374822159] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:25,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:25,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 06:43:25,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975550214] [2023-11-29 06:43:25,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:25,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-29 06:43:25,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:25,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-29 06:43:25,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-29 06:43:25,825 INFO L87 Difference]: Start difference. First operand has 113 states, 87 states have (on average 1.4022988505747127) internal successors, (122), 88 states have internal predecessors, (122), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:43:25,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:25,887 INFO L93 Difference]: Finished difference Result 223 states and 357 transitions. [2023-11-29 06:43:25,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-29 06:43:25,890 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2023-11-29 06:43:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:25,900 INFO L225 Difference]: With dead ends: 223 [2023-11-29 06:43:25,900 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 06:43:25,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 165 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 06:43:25,908 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:25,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 159 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:43:25,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 06:43:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 06:43:25,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3604651162790697) internal successors, (117), 86 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:43:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 163 transitions. [2023-11-29 06:43:25,967 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 163 transitions. Word has length 166 [2023-11-29 06:43:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:25,967 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 163 transitions. [2023-11-29 06:43:25,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:43:25,968 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 163 transitions. [2023-11-29 06:43:25,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 06:43:25,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:25,973 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:25,985 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-29 06:43:26,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:26,174 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:26,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:26,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1750368993, now seen corresponding path program 1 times [2023-11-29 06:43:26,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:26,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1048479079] [2023-11-29 06:43:26,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:26,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:26,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:26,178 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:26,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-29 06:43:26,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:26,624 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:43:26,632 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:26,700 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 520 proven. 0 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2023-11-29 06:43:26,700 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:26,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:26,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1048479079] [2023-11-29 06:43:26,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1048479079] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:26,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:26,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:43:26,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424772978] [2023-11-29 06:43:26,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:26,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:43:26,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:26,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:43:26,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:43:26,706 INFO L87 Difference]: Start difference. First operand 111 states and 163 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:43:26,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:26,875 INFO L93 Difference]: Finished difference Result 227 states and 334 transitions. [2023-11-29 06:43:26,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:43:26,876 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 166 [2023-11-29 06:43:26,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:26,879 INFO L225 Difference]: With dead ends: 227 [2023-11-29 06:43:26,879 INFO L226 Difference]: Without dead ends: 117 [2023-11-29 06:43:26,881 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:43:26,882 INFO L413 NwaCegarLoop]: 160 mSDtfsCounter, 10 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:26,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 469 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:43:26,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2023-11-29 06:43:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 113. [2023-11-29 06:43:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.3522727272727273) internal successors, (119), 88 states have internal predecessors, (119), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:43:26,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2023-11-29 06:43:26,903 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 166 [2023-11-29 06:43:26,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:26,904 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2023-11-29 06:43:26,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2023-11-29 06:43:26,905 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2023-11-29 06:43:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2023-11-29 06:43:26,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:26,909 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:26,917 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-29 06:43:27,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:27,112 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:27,113 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:27,113 INFO L85 PathProgramCache]: Analyzing trace with hash 361074979, now seen corresponding path program 1 times [2023-11-29 06:43:27,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:27,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1505301741] [2023-11-29 06:43:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:27,114 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:27,114 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:27,115 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:27,116 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-29 06:43:27,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:27,612 INFO L262 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:43:27,618 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:27,657 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:27,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:27,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1505301741] [2023-11-29 06:43:27,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1505301741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:27,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:27,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:43:27,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432077383] [2023-11-29 06:43:27,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:27,659 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:43:27,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:27,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:43:27,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:43:27,661 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:27,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:27,717 INFO L93 Difference]: Finished difference Result 223 states and 326 transitions. [2023-11-29 06:43:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:43:27,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 166 [2023-11-29 06:43:27,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:27,721 INFO L225 Difference]: With dead ends: 223 [2023-11-29 06:43:27,721 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 06:43:27,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:43:27,723 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:27,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 304 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:43:27,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 06:43:27,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 06:43:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 86 states have (on average 1.3372093023255813) internal successors, (115), 86 states have internal predecessors, (115), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:43:27,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 161 transitions. [2023-11-29 06:43:27,738 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 161 transitions. Word has length 166 [2023-11-29 06:43:27,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:27,739 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 161 transitions. [2023-11-29 06:43:27,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 161 transitions. [2023-11-29 06:43:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2023-11-29 06:43:27,743 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:27,743 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:27,753 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-11-29 06:43:27,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:27,944 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:27,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:27,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1438058895, now seen corresponding path program 1 times [2023-11-29 06:43:27,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [753494771] [2023-11-29 06:43:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:27,946 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:27,946 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:27,947 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:27,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-29 06:43:28,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:28,385 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:43:28,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:28,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:28,432 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:28,432 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:28,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [753494771] [2023-11-29 06:43:28,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [753494771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:28,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:28,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 06:43:28,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264440696] [2023-11-29 06:43:28,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:28,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:43:28,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:28,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:43:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:43:28,437 INFO L87 Difference]: Start difference. First operand 111 states and 161 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:28,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:28,541 INFO L93 Difference]: Finished difference Result 245 states and 357 transitions. [2023-11-29 06:43:28,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:43:28,542 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 168 [2023-11-29 06:43:28,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:28,545 INFO L225 Difference]: With dead ends: 245 [2023-11-29 06:43:28,545 INFO L226 Difference]: Without dead ends: 135 [2023-11-29 06:43:28,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:43:28,552 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 61 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:28,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 475 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 06:43:28,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-29 06:43:28,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 113. [2023-11-29 06:43:28,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 88 states have (on average 1.3295454545454546) internal successors, (117), 88 states have internal predecessors, (117), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-11-29 06:43:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 163 transitions. [2023-11-29 06:43:28,567 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 163 transitions. Word has length 168 [2023-11-29 06:43:28,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:28,568 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 163 transitions. [2023-11-29 06:43:28,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:28,568 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 163 transitions. [2023-11-29 06:43:28,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2023-11-29 06:43:28,571 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:28,571 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:28,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-29 06:43:28,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:28,772 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:28,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:28,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1037189699, now seen corresponding path program 1 times [2023-11-29 06:43:28,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:28,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [370229439] [2023-11-29 06:43:28,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:28,773 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:28,774 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:28,774 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:28,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-29 06:43:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:29,306 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 06:43:29,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:29,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 06:43:30,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:30,051 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:30,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:30,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [370229439] [2023-11-29 06:43:30,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [370229439] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:30,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:30,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:43:30,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705598789] [2023-11-29 06:43:30,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:30,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 06:43:30,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:30,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 06:43:30,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 06:43:30,056 INFO L87 Difference]: Start difference. First operand 113 states and 163 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:30,446 INFO L93 Difference]: Finished difference Result 339 states and 489 transitions. [2023-11-29 06:43:30,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 06:43:30,447 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 170 [2023-11-29 06:43:30,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:30,450 INFO L225 Difference]: With dead ends: 339 [2023-11-29 06:43:30,450 INFO L226 Difference]: Without dead ends: 227 [2023-11-29 06:43:30,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:43:30,452 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 102 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:30,453 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 420 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:43:30,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-11-29 06:43:30,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 188. [2023-11-29 06:43:30,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 139 states have (on average 1.2805755395683454) internal successors, (178), 139 states have internal predecessors, (178), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 06:43:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 270 transitions. [2023-11-29 06:43:30,480 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 270 transitions. Word has length 170 [2023-11-29 06:43:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:30,481 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 270 transitions. [2023-11-29 06:43:30,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:30,481 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 270 transitions. [2023-11-29 06:43:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2023-11-29 06:43:30,484 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:30,484 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:30,495 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-29 06:43:30,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:30,694 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:30,695 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:30,695 INFO L85 PathProgramCache]: Analyzing trace with hash 495958599, now seen corresponding path program 1 times [2023-11-29 06:43:30,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:30,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328310317] [2023-11-29 06:43:30,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:30,696 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:30,696 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:30,697 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:30,697 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-29 06:43:31,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:31,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 06:43:31,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:31,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:31,146 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:31,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:31,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328310317] [2023-11-29 06:43:31,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328310317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:31,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:31,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 06:43:31,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729476562] [2023-11-29 06:43:31,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:31,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 06:43:31,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:31,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 06:43:31,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:43:31,150 INFO L87 Difference]: Start difference. First operand 188 states and 270 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:31,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:31,207 INFO L93 Difference]: Finished difference Result 327 states and 471 transitions. [2023-11-29 06:43:31,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 06:43:31,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 173 [2023-11-29 06:43:31,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:31,211 INFO L225 Difference]: With dead ends: 327 [2023-11-29 06:43:31,211 INFO L226 Difference]: Without dead ends: 199 [2023-11-29 06:43:31,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 06:43:31,213 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 26 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:31,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 289 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 06:43:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-11-29 06:43:31,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 186. [2023-11-29 06:43:31,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 137 states have (on average 1.27007299270073) internal successors, (174), 137 states have internal predecessors, (174), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 06:43:31,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 266 transitions. [2023-11-29 06:43:31,237 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 266 transitions. Word has length 173 [2023-11-29 06:43:31,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:31,238 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 266 transitions. [2023-11-29 06:43:31,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:31,238 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 266 transitions. [2023-11-29 06:43:31,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:43:31,240 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:31,240 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:31,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-29 06:43:31,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:31,441 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:31,441 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:31,442 INFO L85 PathProgramCache]: Analyzing trace with hash 884410523, now seen corresponding path program 1 times [2023-11-29 06:43:31,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:31,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [105137372] [2023-11-29 06:43:31,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:31,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:31,442 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:31,443 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:31,444 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-29 06:43:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:31,845 INFO L262 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 06:43:31,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:31,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-29 06:43:31,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 06:43:32,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:32,253 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:32,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:32,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [105137372] [2023-11-29 06:43:32,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [105137372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:32,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:32,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 06:43:32,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933451925] [2023-11-29 06:43:32,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:32,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 06:43:32,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:32,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 06:43:32,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:43:32,256 INFO L87 Difference]: Start difference. First operand 186 states and 266 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:33,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:33,527 INFO L93 Difference]: Finished difference Result 499 states and 712 transitions. [2023-11-29 06:43:33,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 06:43:33,527 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:43:33,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:33,532 INFO L225 Difference]: With dead ends: 499 [2023-11-29 06:43:33,532 INFO L226 Difference]: Without dead ends: 373 [2023-11-29 06:43:33,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=158, Invalid=544, Unknown=0, NotChecked=0, Total=702 [2023-11-29 06:43:33,534 INFO L413 NwaCegarLoop]: 221 mSDtfsCounter, 425 mSDsluCounter, 1484 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 1705 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:33,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 1705 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 06:43:33,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2023-11-29 06:43:33,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 225. [2023-11-29 06:43:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 176 states have (on average 1.2840909090909092) internal successors, (226), 176 states have internal predecessors, (226), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 06:43:33,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 318 transitions. [2023-11-29 06:43:33,565 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 318 transitions. Word has length 175 [2023-11-29 06:43:33,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:33,566 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 318 transitions. [2023-11-29 06:43:33,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 318 transitions. [2023-11-29 06:43:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:43:33,569 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:33,569 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:33,580 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-11-29 06:43:33,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:33,770 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:33,770 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:33,770 INFO L85 PathProgramCache]: Analyzing trace with hash 749548951, now seen corresponding path program 1 times [2023-11-29 06:43:33,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:33,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1472853798] [2023-11-29 06:43:33,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:33,772 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:33,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:33,772 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:33,773 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-29 06:43:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:34,176 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:43:34,180 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:34,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:34,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:34,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1472853798] [2023-11-29 06:43:34,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1472853798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:34,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:34,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:43:34,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766024215] [2023-11-29 06:43:34,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:34,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:43:34,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:34,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:43:34,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:43:34,355 INFO L87 Difference]: Start difference. First operand 225 states and 318 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:34,833 INFO L93 Difference]: Finished difference Result 480 states and 668 transitions. [2023-11-29 06:43:34,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:43:34,834 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:43:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:34,838 INFO L225 Difference]: With dead ends: 480 [2023-11-29 06:43:34,838 INFO L226 Difference]: Without dead ends: 315 [2023-11-29 06:43:34,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:43:34,840 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 178 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:34,841 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 698 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:43:34,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2023-11-29 06:43:34,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 276. [2023-11-29 06:43:34,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 219 states have (on average 1.269406392694064) internal successors, (278), 220 states have internal predecessors, (278), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2023-11-29 06:43:34,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 382 transitions. [2023-11-29 06:43:34,865 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 382 transitions. Word has length 175 [2023-11-29 06:43:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:34,866 INFO L495 AbstractCegarLoop]: Abstraction has 276 states and 382 transitions. [2023-11-29 06:43:34,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:34,867 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 382 transitions. [2023-11-29 06:43:34,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:43:34,868 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:34,868 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:34,879 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-29 06:43:35,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:35,069 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:35,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:35,069 INFO L85 PathProgramCache]: Analyzing trace with hash -261568299, now seen corresponding path program 1 times [2023-11-29 06:43:35,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:35,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208672912] [2023-11-29 06:43:35,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:35,070 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:35,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:35,071 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:35,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-29 06:43:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:35,610 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 06:43:35,616 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:35,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-29 06:43:35,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 29 [2023-11-29 06:43:38,434 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:38,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 37 [2023-11-29 06:43:38,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 45 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2023-11-29 06:43:38,763 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:39,052 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:39,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208672912] [2023-11-29 06:43:39,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208672912] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:39,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:43:39,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2023-11-29 06:43:39,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193756818] [2023-11-29 06:43:39,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:39,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:43:39,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:39,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:43:39,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:43:39,055 INFO L87 Difference]: Start difference. First operand 276 states and 382 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:39,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:39,323 INFO L93 Difference]: Finished difference Result 642 states and 887 transitions. [2023-11-29 06:43:39,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:43:39,324 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:43:39,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:39,330 INFO L225 Difference]: With dead ends: 642 [2023-11-29 06:43:39,330 INFO L226 Difference]: Without dead ends: 430 [2023-11-29 06:43:39,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2023-11-29 06:43:39,332 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 206 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:39,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 392 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:43:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2023-11-29 06:43:39,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 338. [2023-11-29 06:43:39,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 281 states have (on average 1.295373665480427) internal successors, (364), 282 states have internal predecessors, (364), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2023-11-29 06:43:39,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 468 transitions. [2023-11-29 06:43:39,361 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 468 transitions. Word has length 175 [2023-11-29 06:43:39,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:39,362 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 468 transitions. [2023-11-29 06:43:39,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:39,362 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 468 transitions. [2023-11-29 06:43:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:43:39,364 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:39,364 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:39,375 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-11-29 06:43:39,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:39,565 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:39,565 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:39,565 INFO L85 PathProgramCache]: Analyzing trace with hash 812436631, now seen corresponding path program 1 times [2023-11-29 06:43:39,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:39,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1306703326] [2023-11-29 06:43:39,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:39,566 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:39,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:39,567 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:39,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-29 06:43:39,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:39,941 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:43:39,946 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:40,083 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:40,083 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:40,083 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:40,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1306703326] [2023-11-29 06:43:40,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1306703326] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:40,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:40,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:43:40,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51236978] [2023-11-29 06:43:40,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:40,085 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:43:40,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:40,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:43:40,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:43:40,086 INFO L87 Difference]: Start difference. First operand 338 states and 468 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:40,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:40,517 INFO L93 Difference]: Finished difference Result 631 states and 869 transitions. [2023-11-29 06:43:40,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:43:40,518 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:43:40,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:40,520 INFO L225 Difference]: With dead ends: 631 [2023-11-29 06:43:40,520 INFO L226 Difference]: Without dead ends: 357 [2023-11-29 06:43:40,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:43:40,522 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 79 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:40,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 691 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:43:40,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2023-11-29 06:43:40,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 309. [2023-11-29 06:43:40,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 252 states have (on average 1.2817460317460319) internal successors, (323), 253 states have internal predecessors, (323), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2023-11-29 06:43:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 427 transitions. [2023-11-29 06:43:40,539 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 427 transitions. Word has length 175 [2023-11-29 06:43:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:40,540 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 427 transitions. [2023-11-29 06:43:40,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 427 transitions. [2023-11-29 06:43:40,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:43:40,542 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:40,542 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:40,550 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2023-11-29 06:43:40,742 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:40,742 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:40,743 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:40,743 INFO L85 PathProgramCache]: Analyzing trace with hash -771041389, now seen corresponding path program 1 times [2023-11-29 06:43:40,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:40,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1344361725] [2023-11-29 06:43:40,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:40,744 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:40,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:40,745 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:40,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-29 06:43:41,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:41,270 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 06:43:41,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:41,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-29 06:43:42,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 24 [2023-11-29 06:43:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 548 proven. 39 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2023-11-29 06:43:42,989 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:43,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:43,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:43,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1344361725] [2023-11-29 06:43:43,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1344361725] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:43,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:43:43,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2023-11-29 06:43:43,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803750759] [2023-11-29 06:43:43,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:43,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:43:43,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:43,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:43:43,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:43:43,257 INFO L87 Difference]: Start difference. First operand 309 states and 427 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:43,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:43,554 INFO L93 Difference]: Finished difference Result 761 states and 1042 transitions. [2023-11-29 06:43:43,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:43:43,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:43:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:43,558 INFO L225 Difference]: With dead ends: 761 [2023-11-29 06:43:43,558 INFO L226 Difference]: Without dead ends: 516 [2023-11-29 06:43:43,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:43:43,560 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 121 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:43,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 584 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:43:43,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2023-11-29 06:43:43,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 449. [2023-11-29 06:43:43,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 375 states have (on average 1.2826666666666666) internal successors, (481), 378 states have internal predecessors, (481), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 63 states have call predecessors, (66), 66 states have call successors, (66) [2023-11-29 06:43:43,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 613 transitions. [2023-11-29 06:43:43,593 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 613 transitions. Word has length 175 [2023-11-29 06:43:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:43,594 INFO L495 AbstractCegarLoop]: Abstraction has 449 states and 613 transitions. [2023-11-29 06:43:43,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:43,595 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 613 transitions. [2023-11-29 06:43:43,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:43:43,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:43,597 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:43,608 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-29 06:43:43,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:43,797 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:43,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:43,798 INFO L85 PathProgramCache]: Analyzing trace with hash -709001775, now seen corresponding path program 1 times [2023-11-29 06:43:43,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:43,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088149111] [2023-11-29 06:43:43,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:43,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:43,799 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:43,799 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:43,800 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-29 06:43:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:44,222 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:43:44,226 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:44,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:44,360 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:44,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:44,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088149111] [2023-11-29 06:43:44,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088149111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:44,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:44,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:43:44,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289356026] [2023-11-29 06:43:44,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:44,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:43:44,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:44,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:43:44,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:43:44,362 INFO L87 Difference]: Start difference. First operand 449 states and 613 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:44,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:44,841 INFO L93 Difference]: Finished difference Result 875 states and 1187 transitions. [2023-11-29 06:43:44,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:43:44,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:43:44,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:44,847 INFO L225 Difference]: With dead ends: 875 [2023-11-29 06:43:44,847 INFO L226 Difference]: Without dead ends: 494 [2023-11-29 06:43:44,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:43:44,849 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 79 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:44,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 886 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:43:44,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2023-11-29 06:43:44,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 348. [2023-11-29 06:43:44,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 286 states have (on average 1.2692307692307692) internal successors, (363), 287 states have internal predecessors, (363), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 06:43:44,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 471 transitions. [2023-11-29 06:43:44,883 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 471 transitions. Word has length 175 [2023-11-29 06:43:44,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:44,883 INFO L495 AbstractCegarLoop]: Abstraction has 348 states and 471 transitions. [2023-11-29 06:43:44,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:44,884 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 471 transitions. [2023-11-29 06:43:44,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:43:44,885 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:44,885 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:44,897 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-11-29 06:43:45,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:45,086 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:45,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:45,087 INFO L85 PathProgramCache]: Analyzing trace with hash 302963541, now seen corresponding path program 1 times [2023-11-29 06:43:45,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:45,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951207061] [2023-11-29 06:43:45,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:45,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:45,087 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:45,088 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:45,089 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-29 06:43:45,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:45,649 INFO L262 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 06:43:45,654 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:45,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-11-29 06:43:45,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2023-11-29 06:43:47,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 18 [2023-11-29 06:43:47,416 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 486 proven. 45 refuted. 0 times theorem prover too weak. 481 trivial. 0 not checked. [2023-11-29 06:43:47,416 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:47,678 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:47,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:47,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951207061] [2023-11-29 06:43:47,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951207061] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:47,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:43:47,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 12 [2023-11-29 06:43:47,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100066776] [2023-11-29 06:43:47,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:47,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:43:47,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:47,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:43:47,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-11-29 06:43:47,681 INFO L87 Difference]: Start difference. First operand 348 states and 471 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:47,983 INFO L93 Difference]: Finished difference Result 700 states and 945 transitions. [2023-11-29 06:43:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:43:47,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:43:47,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:47,986 INFO L225 Difference]: With dead ends: 700 [2023-11-29 06:43:47,986 INFO L226 Difference]: Without dead ends: 420 [2023-11-29 06:43:47,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 336 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2023-11-29 06:43:47,988 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 66 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:47,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 650 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 06:43:47,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2023-11-29 06:43:48,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 346. [2023-11-29 06:43:48,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 284 states have (on average 1.2605633802816902) internal successors, (358), 285 states have internal predecessors, (358), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2023-11-29 06:43:48,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 466 transitions. [2023-11-29 06:43:48,014 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 466 transitions. Word has length 175 [2023-11-29 06:43:48,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:48,014 INFO L495 AbstractCegarLoop]: Abstraction has 346 states and 466 transitions. [2023-11-29 06:43:48,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:48,015 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 466 transitions. [2023-11-29 06:43:48,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:43:48,016 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:48,016 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:48,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2023-11-29 06:43:48,217 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:48,217 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:48,217 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:48,218 INFO L85 PathProgramCache]: Analyzing trace with hash -708153709, now seen corresponding path program 1 times [2023-11-29 06:43:48,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:48,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204772759] [2023-11-29 06:43:48,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:48,219 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:48,219 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:48,220 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:48,221 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-29 06:43:48,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:48,780 INFO L262 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-29 06:43:48,785 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:48,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 06:43:49,462 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-29 06:43:49,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2023-11-29 06:43:49,552 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:49,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:49,768 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:49,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204772759] [2023-11-29 06:43:49,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204772759] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:49,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:43:49,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 10 [2023-11-29 06:43:49,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142951795] [2023-11-29 06:43:49,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:49,769 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:43:49,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:49,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:43:49,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-29 06:43:49,770 INFO L87 Difference]: Start difference. First operand 346 states and 466 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:50,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:50,055 INFO L93 Difference]: Finished difference Result 629 states and 844 transitions. [2023-11-29 06:43:50,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 06:43:50,056 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:43:50,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:50,058 INFO L225 Difference]: With dead ends: 629 [2023-11-29 06:43:50,058 INFO L226 Difference]: Without dead ends: 351 [2023-11-29 06:43:50,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-11-29 06:43:50,060 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 120 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 526 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:50,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 526 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 06:43:50,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-11-29 06:43:50,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 303. [2023-11-29 06:43:50,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 250 states have (on average 1.26) internal successors, (315), 250 states have internal predecessors, (315), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 06:43:50,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 407 transitions. [2023-11-29 06:43:50,074 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 407 transitions. Word has length 175 [2023-11-29 06:43:50,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:50,075 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 407 transitions. [2023-11-29 06:43:50,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:50,075 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 407 transitions. [2023-11-29 06:43:50,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:43:50,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:50,076 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:50,089 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2023-11-29 06:43:50,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:50,277 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:50,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:50,277 INFO L85 PathProgramCache]: Analyzing trace with hash -449988271, now seen corresponding path program 1 times [2023-11-29 06:43:50,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:50,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [127207028] [2023-11-29 06:43:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:50,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:50,279 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:50,280 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:50,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-29 06:43:50,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:50,695 INFO L262 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 06:43:50,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:50,817 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:50,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:50,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [127207028] [2023-11-29 06:43:50,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [127207028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:50,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:50,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 06:43:50,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504994387] [2023-11-29 06:43:50,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:50,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 06:43:50,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:50,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 06:43:50,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 06:43:50,820 INFO L87 Difference]: Start difference. First operand 303 states and 407 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:51,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:51,261 INFO L93 Difference]: Finished difference Result 602 states and 808 transitions. [2023-11-29 06:43:51,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:43:51,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:43:51,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:51,265 INFO L225 Difference]: With dead ends: 602 [2023-11-29 06:43:51,265 INFO L226 Difference]: Without dead ends: 367 [2023-11-29 06:43:51,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-11-29 06:43:51,266 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 102 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:51,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 839 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 06:43:51,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-11-29 06:43:51,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 303. [2023-11-29 06:43:51,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 250 states have (on average 1.256) internal successors, (314), 250 states have internal predecessors, (314), 46 states have call successors, (46), 6 states have call predecessors, (46), 6 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-29 06:43:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 406 transitions. [2023-11-29 06:43:51,281 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 406 transitions. Word has length 175 [2023-11-29 06:43:51,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:51,281 INFO L495 AbstractCegarLoop]: Abstraction has 303 states and 406 transitions. [2023-11-29 06:43:51,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 6 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 406 transitions. [2023-11-29 06:43:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2023-11-29 06:43:51,283 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:51,283 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:51,292 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-29 06:43:51,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:51,484 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:51,484 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:51,484 INFO L85 PathProgramCache]: Analyzing trace with hash -843015281, now seen corresponding path program 1 times [2023-11-29 06:43:51,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:51,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1837007681] [2023-11-29 06:43:51,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:51,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:51,485 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:51,486 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:51,487 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-29 06:43:52,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:52,034 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 06:43:52,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:52,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 06:43:52,338 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2023-11-29 06:43:52,616 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:52,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 43 [2023-11-29 06:43:55,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:55,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 56 [2023-11-29 06:43:55,946 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:43:55,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 90 treesize of output 42 [2023-11-29 06:43:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 458 proven. 102 refuted. 0 times theorem prover too weak. 452 trivial. 0 not checked. [2023-11-29 06:43:56,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:43:57,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:57,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:57,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1837007681] [2023-11-29 06:43:57,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1837007681] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 06:43:57,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:43:57,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [19] total 24 [2023-11-29 06:43:57,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515586306] [2023-11-29 06:43:57,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:57,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 06:43:57,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:57,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 06:43:57,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=477, Unknown=0, NotChecked=0, Total=552 [2023-11-29 06:43:57,417 INFO L87 Difference]: Start difference. First operand 303 states and 406 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:43:58,771 INFO L93 Difference]: Finished difference Result 581 states and 779 transitions. [2023-11-29 06:43:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 06:43:58,771 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 175 [2023-11-29 06:43:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:43:58,774 INFO L225 Difference]: With dead ends: 581 [2023-11-29 06:43:58,774 INFO L226 Difference]: Without dead ends: 346 [2023-11-29 06:43:58,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2023-11-29 06:43:58,776 INFO L413 NwaCegarLoop]: 202 mSDtfsCounter, 163 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 215 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1440 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 06:43:58,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1440 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 215 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 06:43:58,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-11-29 06:43:58,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 332. [2023-11-29 06:43:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 274 states have (on average 1.2591240875912408) internal successors, (345), 275 states have internal predecessors, (345), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 06:43:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 445 transitions. [2023-11-29 06:43:58,793 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 445 transitions. Word has length 175 [2023-11-29 06:43:58,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:43:58,794 INFO L495 AbstractCegarLoop]: Abstraction has 332 states and 445 transitions. [2023-11-29 06:43:58,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:43:58,794 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 445 transitions. [2023-11-29 06:43:58,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2023-11-29 06:43:58,796 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:43:58,796 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:43:58,808 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-11-29 06:43:58,996 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:58,996 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:43:58,997 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:43:58,997 INFO L85 PathProgramCache]: Analyzing trace with hash 816954960, now seen corresponding path program 1 times [2023-11-29 06:43:58,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:43:58,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [954691291] [2023-11-29 06:43:58,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:43:58,998 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:43:58,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:43:58,999 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:43:59,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-29 06:43:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:43:59,432 INFO L262 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 06:43:59,435 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:43:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:43:59,475 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 06:43:59,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:43:59,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [954691291] [2023-11-29 06:43:59,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [954691291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 06:43:59,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 06:43:59,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 06:43:59,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191789363] [2023-11-29 06:43:59,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:43:59,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 06:43:59,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:43:59,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 06:43:59,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 06:43:59,477 INFO L87 Difference]: Start difference. First operand 332 states and 445 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:44:01,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 06:44:01,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:44:01,224 INFO L93 Difference]: Finished difference Result 608 states and 815 transitions. [2023-11-29 06:44:01,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 06:44:01,224 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 177 [2023-11-29 06:44:01,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:44:01,227 INFO L225 Difference]: With dead ends: 608 [2023-11-29 06:44:01,227 INFO L226 Difference]: Without dead ends: 344 [2023-11-29 06:44:01,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 06:44:01,229 INFO L413 NwaCegarLoop]: 148 mSDtfsCounter, 24 mSDsluCounter, 427 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-11-29 06:44:01,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 575 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-11-29 06:44:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2023-11-29 06:44:01,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 338. [2023-11-29 06:44:01,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 280 states have (on average 1.2535714285714286) internal successors, (351), 281 states have internal predecessors, (351), 50 states have call successors, (50), 7 states have call predecessors, (50), 7 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2023-11-29 06:44:01,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 451 transitions. [2023-11-29 06:44:01,246 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 451 transitions. Word has length 177 [2023-11-29 06:44:01,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:44:01,246 INFO L495 AbstractCegarLoop]: Abstraction has 338 states and 451 transitions. [2023-11-29 06:44:01,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:44:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 451 transitions. [2023-11-29 06:44:01,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 06:44:01,248 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:44:01,248 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:01,256 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2023-11-29 06:44:01,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:01,449 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:44:01,449 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:01,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1212426507, now seen corresponding path program 1 times [2023-11-29 06:44:01,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:44:01,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1439766532] [2023-11-29 06:44:01,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:01,450 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:01,450 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:44:01,451 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:44:01,452 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-29 06:44:02,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 06:44:02,272 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 06:44:02,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 06:44:02,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 06:44:02,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 31 [2023-11-29 06:44:03,708 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 06:44:03,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 41 [2023-11-29 06:44:03,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 481 proven. 36 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2023-11-29 06:44:03,884 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 06:44:04,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2023-11-29 06:44:04,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 06:44:04,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1439766532] [2023-11-29 06:44:04,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1439766532] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 06:44:04,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 06:44:04,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [16] total 21 [2023-11-29 06:44:04,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973558834] [2023-11-29 06:44:04,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 06:44:04,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 06:44:04,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 06:44:04,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 06:44:04,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2023-11-29 06:44:04,598 INFO L87 Difference]: Start difference. First operand 338 states and 451 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:44:08,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 06:44:11,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-11-29 06:44:12,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 06:44:12,001 INFO L93 Difference]: Finished difference Result 604 states and 797 transitions. [2023-11-29 06:44:12,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 06:44:12,002 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 179 [2023-11-29 06:44:12,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 06:44:12,006 INFO L225 Difference]: With dead ends: 604 [2023-11-29 06:44:12,007 INFO L226 Difference]: Without dead ends: 602 [2023-11-29 06:44:12,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 360 GetRequests, 337 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=91, Invalid=509, Unknown=0, NotChecked=0, Total=600 [2023-11-29 06:44:12,008 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 106 mSDsluCounter, 962 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1153 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-11-29 06:44:12,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1153 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-11-29 06:44:12,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2023-11-29 06:44:12,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 591. [2023-11-29 06:44:12,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 591 states, 510 states have (on average 1.2627450980392156) internal successors, (644), 513 states have internal predecessors, (644), 69 states have call successors, (69), 11 states have call predecessors, (69), 11 states have return successors, (69), 66 states have call predecessors, (69), 69 states have call successors, (69) [2023-11-29 06:44:12,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 591 states and 782 transitions. [2023-11-29 06:44:12,049 INFO L78 Accepts]: Start accepts. Automaton has 591 states and 782 transitions. Word has length 179 [2023-11-29 06:44:12,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 06:44:12,050 INFO L495 AbstractCegarLoop]: Abstraction has 591 states and 782 transitions. [2023-11-29 06:44:12,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2023-11-29 06:44:12,050 INFO L276 IsEmpty]: Start isEmpty. Operand 591 states and 782 transitions. [2023-11-29 06:44:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2023-11-29 06:44:12,052 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 06:44:12,052 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 06:44:12,064 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-29 06:44:12,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:12,252 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-29 06:44:12,253 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 06:44:12,253 INFO L85 PathProgramCache]: Analyzing trace with hash 838557491, now seen corresponding path program 1 times [2023-11-29 06:44:12,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 06:44:12,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1652539237] [2023-11-29 06:44:12,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 06:44:12,253 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 06:44:12,254 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 06:44:12,254 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-29 06:44:12,255 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f47e9309-b35f-49ba-ad96-cd629ceb9113/bin/uautomizer-verify-BQ2R08f2Ya/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process