./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 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_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX --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 eaa60ed61738bb84f21e0e7461cdcc453d531566de1a87a0cbf8ab788e5233b0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:09:29,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:09:29,816 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 17:09:29,825 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:09:29,825 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:09:29,860 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:09:29,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:09:29,861 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:09:29,862 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:09:29,862 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:09:29,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:09:29,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:09:29,865 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:09:29,866 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:09:29,866 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:09:29,867 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:09:29,867 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:09:29,868 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:09:29,868 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:09:29,868 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:09:29,873 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:09:29,873 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:09:29,874 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:09:29,874 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:09:29,874 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:09:29,875 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:09:29,875 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:09:29,875 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:09:29,876 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:09:29,876 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:09:29,876 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:09:29,876 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:09:29,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:09:29,879 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:09:29,879 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:09:29,879 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:09:29,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:09:29,880 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:09:29,880 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:09:29,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:09:29,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:09:29,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:09:29,882 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_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX 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 -> eaa60ed61738bb84f21e0e7461cdcc453d531566de1a87a0cbf8ab788e5233b0 [2024-11-08 17:09:30,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:09:30,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:09:30,232 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:09:30,234 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:09:30,234 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:09:30,235 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i Unable to find full path for "g++" [2024-11-08 17:09:32,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:09:32,453 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:09:32,454 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-11-08 17:09:32,468 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/data/ed3474957/110b2fc713c540ac950f4abb424e9543/FLAG78a54f9d9 [2024-11-08 17:09:32,484 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/data/ed3474957/110b2fc713c540ac950f4abb424e9543 [2024-11-08 17:09:32,487 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:09:32,490 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:09:32,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:09:32,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:09:32,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:09:32,502 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:09:32" (1/1) ... [2024-11-08 17:09:32,503 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3915846d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:32, skipping insertion in model container [2024-11-08 17:09:32,504 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:09:32" (1/1) ... [2024-11-08 17:09:32,535 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:09:32,805 WARN L250 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_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i[916,929] [2024-11-08 17:09:32,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:09:32,906 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:09:32,917 WARN L250 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_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i[916,929] [2024-11-08 17:09:32,969 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:09:33,008 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:09:33,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33 WrapperNode [2024-11-08 17:09:33,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:09:33,010 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:09:33,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:09:33,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:09:33,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (1/1) ... [2024-11-08 17:09:33,042 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (1/1) ... [2024-11-08 17:09:33,127 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2024-11-08 17:09:33,127 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:09:33,134 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:09:33,134 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:09:33,135 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:09:33,152 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (1/1) ... [2024-11-08 17:09:33,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (1/1) ... [2024-11-08 17:09:33,164 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (1/1) ... [2024-11-08 17:09:33,204 INFO L175 MemorySlicer]: Split 131 memory accesses to 7 slices as follows [2, 36, 8, 19, 38, 17, 11]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 1, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 1, 2, 4, 2, 1]. [2024-11-08 17:09:33,208 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (1/1) ... [2024-11-08 17:09:33,208 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (1/1) ... [2024-11-08 17:09:33,246 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (1/1) ... [2024-11-08 17:09:33,250 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (1/1) ... [2024-11-08 17:09:33,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (1/1) ... [2024-11-08 17:09:33,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (1/1) ... [2024-11-08 17:09:33,263 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:09:33,264 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:09:33,264 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:09:33,265 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:09:33,266 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (1/1) ... [2024-11-08 17:09:33,273 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:09:33,289 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:09:33,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:09:33,314 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:09:33,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:09:33,348 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-08 17:09:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-08 17:09:33,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-08 17:09:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-08 17:09:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-08 17:09:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-08 17:09:33,350 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-08 17:09:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-08 17:09:33,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-08 17:09:33,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-08 17:09:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-08 17:09:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-08 17:09:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-08 17:09:33,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-08 17:09:33,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-08 17:09:33,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-08 17:09:33,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-08 17:09:33,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-08 17:09:33,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-08 17:09:33,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-08 17:09:33,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-08 17:09:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-08 17:09:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-08 17:09:33,358 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-08 17:09:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-08 17:09:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-08 17:09:33,359 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-08 17:09:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-08 17:09:33,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-08 17:09:33,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-08 17:09:33,361 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-08 17:09:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-08 17:09:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-08 17:09:33,362 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-08 17:09:33,363 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-08 17:09:33,364 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:09:33,364 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:09:33,364 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:09:33,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:09:33,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-08 17:09:33,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-08 17:09:33,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-08 17:09:33,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-08 17:09:33,366 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-08 17:09:33,366 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:09:33,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:09:33,601 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:09:33,604 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:09:34,276 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-08 17:09:34,276 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:09:34,303 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:09:34,303 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:09:34,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:09:34 BoogieIcfgContainer [2024-11-08 17:09:34,304 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:09:34,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:09:34,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:09:34,317 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:09:34,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:09:32" (1/3) ... [2024-11-08 17:09:34,318 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a857b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:09:34, skipping insertion in model container [2024-11-08 17:09:34,319 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:09:33" (2/3) ... [2024-11-08 17:09:34,320 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54a857b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:09:34, skipping insertion in model container [2024-11-08 17:09:34,320 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:09:34" (3/3) ... [2024-11-08 17:09:34,322 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-44.i [2024-11-08 17:09:34,343 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:09:34,343 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:09:34,431 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:09:34,442 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@707c3ca9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:09:34,444 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:09:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 95 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:09:34,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:09:34,472 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:34,473 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:34,474 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:34,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:34,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1626087399, now seen corresponding path program 1 times [2024-11-08 17:09:34,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:34,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73692469] [2024-11-08 17:09:34,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:34,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:34,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:34,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:34,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:34,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:34,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:35,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:35,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:35,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:35,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:35,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:35,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:35,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:35,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,180 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:35,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:35,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73692469] [2024-11-08 17:09:35,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73692469] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:35,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:35,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:09:35,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102065458] [2024-11-08 17:09:35,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:35,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:09:35,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:35,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:09:35,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:09:35,230 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 95 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:09:35,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:35,276 INFO L93 Difference]: Finished difference Result 229 states and 359 transitions. [2024-11-08 17:09:35,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:09:35,279 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-11-08 17:09:35,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:35,293 INFO L225 Difference]: With dead ends: 229 [2024-11-08 17:09:35,293 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 17:09:35,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:09:35,301 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:35,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:09:35,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 17:09:35,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-08 17:09:35,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:09:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2024-11-08 17:09:35,366 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 159 [2024-11-08 17:09:35,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:35,369 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2024-11-08 17:09:35,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:09:35,369 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2024-11-08 17:09:35,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:09:35,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:35,377 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:35,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:09:35,378 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:35,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:35,379 INFO L85 PathProgramCache]: Analyzing trace with hash -617465663, now seen corresponding path program 1 times [2024-11-08 17:09:35,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:35,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493985019] [2024-11-08 17:09:35,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:35,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:35,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:35,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:35,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:35,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:35,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:35,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:35,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:35,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:35,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:35,941 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:35,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:35,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493985019] [2024-11-08 17:09:35,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493985019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:35,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:35,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:09:35,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705441475] [2024-11-08 17:09:35,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:35,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:09:35,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:35,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:09:35,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:35,946 INFO L87 Difference]: Start difference. First operand 114 states and 165 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:09:36,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:36,005 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2024-11-08 17:09:36,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:09:36,006 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-11-08 17:09:36,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:36,008 INFO L225 Difference]: With dead ends: 227 [2024-11-08 17:09:36,008 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 17:09:36,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:36,010 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:36,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:09:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 17:09:36,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-08 17:09:36,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:09:36,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2024-11-08 17:09:36,025 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 159 [2024-11-08 17:09:36,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:36,027 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2024-11-08 17:09:36,027 INFO L472 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:09:36,028 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2024-11-08 17:09:36,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:09:36,030 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:36,031 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:36,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:09:36,031 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:36,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:36,032 INFO L85 PathProgramCache]: Analyzing trace with hash 2076430527, now seen corresponding path program 1 times [2024-11-08 17:09:36,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:36,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982939453] [2024-11-08 17:09:36,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:36,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:36,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:36,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:36,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:36,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:36,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:36,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:36,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:36,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:36,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,356 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:36,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:36,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982939453] [2024-11-08 17:09:36,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982939453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:36,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:36,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:09:36,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072818827] [2024-11-08 17:09:36,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:36,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:09:36,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:36,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:09:36,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:36,364 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:36,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:36,429 INFO L93 Difference]: Finished difference Result 232 states and 335 transitions. [2024-11-08 17:09:36,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:09:36,431 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), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-08 17:09:36,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:36,435 INFO L225 Difference]: With dead ends: 232 [2024-11-08 17:09:36,438 INFO L226 Difference]: Without dead ends: 119 [2024-11-08 17:09:36,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:36,440 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 1 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:36,441 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 477 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:09:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-08 17:09:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2024-11-08 17:09:36,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 95 states have (on average 1.3368421052631578) internal successors, (127), 95 states have internal predecessors, (127), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:09:36,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 169 transitions. [2024-11-08 17:09:36,457 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 169 transitions. Word has length 159 [2024-11-08 17:09:36,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:36,458 INFO L471 AbstractCegarLoop]: Abstraction has 118 states and 169 transitions. [2024-11-08 17:09:36,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:36,458 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 169 transitions. [2024-11-08 17:09:36,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:09:36,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:36,461 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:36,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:09:36,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:36,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:36,462 INFO L85 PathProgramCache]: Analyzing trace with hash 2078277569, now seen corresponding path program 1 times [2024-11-08 17:09:36,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:36,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230274918] [2024-11-08 17:09:36,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:36,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:36,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:36,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:36,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:36,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:36,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:36,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:37,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:37,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:37,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,060 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:37,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:37,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230274918] [2024-11-08 17:09:37,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230274918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:37,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:37,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:09:37,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480083110] [2024-11-08 17:09:37,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:37,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:09:37,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:37,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:09:37,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:09:37,064 INFO L87 Difference]: Start difference. First operand 118 states and 169 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:37,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:37,350 INFO L93 Difference]: Finished difference Result 335 states and 481 transitions. [2024-11-08 17:09:37,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:09:37,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-08 17:09:37,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:37,353 INFO L225 Difference]: With dead ends: 335 [2024-11-08 17:09:37,353 INFO L226 Difference]: Without dead ends: 220 [2024-11-08 17:09:37,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:09:37,359 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 130 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:37,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 838 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:09:37,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2024-11-08 17:09:37,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 217. [2024-11-08 17:09:37,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.344632768361582) internal successors, (238), 178 states have internal predecessors, (238), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 17:09:37,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 312 transitions. [2024-11-08 17:09:37,400 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 312 transitions. Word has length 159 [2024-11-08 17:09:37,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:37,403 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 312 transitions. [2024-11-08 17:09:37,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 312 transitions. [2024-11-08 17:09:37,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:09:37,410 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:37,410 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:37,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:09:37,411 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:37,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:37,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1710646956, now seen corresponding path program 1 times [2024-11-08 17:09:37,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:37,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649818034] [2024-11-08 17:09:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:37,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:37,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:37,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:37,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:37,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:37,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:37,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:37,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:37,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:37,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:37,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:37,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:37,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:37,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:37,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:38,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:38,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,011 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:38,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:38,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649818034] [2024-11-08 17:09:38,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649818034] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:38,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:38,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:09:38,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458516921] [2024-11-08 17:09:38,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:38,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:09:38,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:38,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:09:38,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:09:38,020 INFO L87 Difference]: Start difference. First operand 217 states and 312 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:38,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:38,393 INFO L93 Difference]: Finished difference Result 472 states and 676 transitions. [2024-11-08 17:09:38,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:09:38,394 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 160 [2024-11-08 17:09:38,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:38,401 INFO L225 Difference]: With dead ends: 472 [2024-11-08 17:09:38,402 INFO L226 Difference]: Without dead ends: 258 [2024-11-08 17:09:38,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:09:38,404 INFO L432 NwaCegarLoop]: 272 mSDtfsCounter, 114 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1096 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:38,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1096 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:09:38,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-08 17:09:38,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 254. [2024-11-08 17:09:38,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 203 states have (on average 1.3251231527093597) internal successors, (269), 205 states have internal predecessors, (269), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-08 17:09:38,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 363 transitions. [2024-11-08 17:09:38,459 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 363 transitions. Word has length 160 [2024-11-08 17:09:38,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:38,460 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 363 transitions. [2024-11-08 17:09:38,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:38,462 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 363 transitions. [2024-11-08 17:09:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-08 17:09:38,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:38,466 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:38,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:09:38,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:38,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash -462565844, now seen corresponding path program 1 times [2024-11-08 17:09:38,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:38,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958691966] [2024-11-08 17:09:38,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:38,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:38,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:38,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:38,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:38,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:38,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:38,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:38,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:38,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:38,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:38,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:38,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:38,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:38,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:38,853 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:38,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958691966] [2024-11-08 17:09:38,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958691966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:38,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:38,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:09:38,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353176956] [2024-11-08 17:09:38,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:38,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:09:38,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:38,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:09:38,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:09:38,856 INFO L87 Difference]: Start difference. First operand 254 states and 363 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:38,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:38,907 INFO L93 Difference]: Finished difference Result 478 states and 682 transitions. [2024-11-08 17:09:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:09:38,908 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), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 161 [2024-11-08 17:09:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:38,910 INFO L225 Difference]: With dead ends: 478 [2024-11-08 17:09:38,910 INFO L226 Difference]: Without dead ends: 260 [2024-11-08 17:09:38,911 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:09:38,912 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 0 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:38,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 631 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:09:38,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-08 17:09:38,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-11-08 17:09:38,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 209 states have (on average 1.3157894736842106) internal successors, (275), 211 states have internal predecessors, (275), 47 states have call successors, (47), 3 states have call predecessors, (47), 3 states have return successors, (47), 45 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-08 17:09:38,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 369 transitions. [2024-11-08 17:09:38,931 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 369 transitions. Word has length 161 [2024-11-08 17:09:38,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:38,932 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 369 transitions. [2024-11-08 17:09:38,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:38,935 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 369 transitions. [2024-11-08 17:09:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:09:38,937 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:38,937 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:38,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:09:38,938 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:38,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:38,938 INFO L85 PathProgramCache]: Analyzing trace with hash -690871079, now seen corresponding path program 1 times [2024-11-08 17:09:38,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:38,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562713603] [2024-11-08 17:09:38,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:38,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:39,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:39,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:39,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:39,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562713603] [2024-11-08 17:09:39,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562713603] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:39,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:39,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:09:39,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814364984] [2024-11-08 17:09:39,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:39,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:09:39,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:39,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:09:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:09:39,442 INFO L87 Difference]: Start difference. First operand 260 states and 369 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:39,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:39,769 INFO L93 Difference]: Finished difference Result 490 states and 686 transitions. [2024-11-08 17:09:39,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:09:39,770 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), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-11-08 17:09:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:39,773 INFO L225 Difference]: With dead ends: 490 [2024-11-08 17:09:39,773 INFO L226 Difference]: Without dead ends: 266 [2024-11-08 17:09:39,774 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:09:39,775 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 108 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:39,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 651 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:09:39,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-08 17:09:39,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 225. [2024-11-08 17:09:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 183 states have (on average 1.3060109289617485) internal successors, (239), 184 states have internal predecessors, (239), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 17:09:39,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 313 transitions. [2024-11-08 17:09:39,812 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 313 transitions. Word has length 163 [2024-11-08 17:09:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:39,813 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 313 transitions. [2024-11-08 17:09:39,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:39,813 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 313 transitions. [2024-11-08 17:09:39,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:09:39,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:39,816 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:39,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 17:09:39,817 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:39,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:39,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1539699791, now seen corresponding path program 1 times [2024-11-08 17:09:39,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:39,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427199965] [2024-11-08 17:09:39,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:39,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:39,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:40,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:40,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:40,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:40,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:40,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:40,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:40,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:40,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:40,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,089 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:40,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:40,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427199965] [2024-11-08 17:09:40,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427199965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:40,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:40,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 17:09:40,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792840736] [2024-11-08 17:09:40,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:40,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 17:09:40,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:40,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 17:09:40,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:09:40,093 INFO L87 Difference]: Start difference. First operand 225 states and 313 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:40,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:40,123 INFO L93 Difference]: Finished difference Result 447 states and 623 transitions. [2024-11-08 17:09:40,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 17:09:40,124 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-11-08 17:09:40,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:40,126 INFO L225 Difference]: With dead ends: 447 [2024-11-08 17:09:40,127 INFO L226 Difference]: Without dead ends: 225 [2024-11-08 17:09:40,128 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 17:09:40,129 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:40,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:09:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2024-11-08 17:09:40,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2024-11-08 17:09:40,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 183 states have (on average 1.2950819672131149) internal successors, (237), 184 states have internal predecessors, (237), 37 states have call successors, (37), 4 states have call predecessors, (37), 4 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 17:09:40,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 311 transitions. [2024-11-08 17:09:40,150 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 311 transitions. Word has length 163 [2024-11-08 17:09:40,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:40,150 INFO L471 AbstractCegarLoop]: Abstraction has 225 states and 311 transitions. [2024-11-08 17:09:40,151 INFO L472 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:40,151 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 311 transitions. [2024-11-08 17:09:40,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 17:09:40,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:40,153 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:40,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 17:09:40,154 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:40,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:40,154 INFO L85 PathProgramCache]: Analyzing trace with hash 748600556, now seen corresponding path program 1 times [2024-11-08 17:09:40,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:40,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473745388] [2024-11-08 17:09:40,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:40,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:40,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:40,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:40,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:40,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:40,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:40,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:40,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:40,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:40,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:41,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,005 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:41,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:41,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473745388] [2024-11-08 17:09:41,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473745388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:41,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:41,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:09:41,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129151036] [2024-11-08 17:09:41,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:41,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:09:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:41,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:09:41,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:41,010 INFO L87 Difference]: Start difference. First operand 225 states and 311 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:41,202 INFO L93 Difference]: Finished difference Result 669 states and 927 transitions. [2024-11-08 17:09:41,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:09:41,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 164 [2024-11-08 17:09:41,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:41,208 INFO L225 Difference]: With dead ends: 669 [2024-11-08 17:09:41,209 INFO L226 Difference]: Without dead ends: 447 [2024-11-08 17:09:41,210 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:09:41,211 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 98 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:41,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 421 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:09:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2024-11-08 17:09:41,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 433. [2024-11-08 17:09:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 350 states have (on average 1.2857142857142858) internal successors, (450), 352 states have internal predecessors, (450), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-08 17:09:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 598 transitions. [2024-11-08 17:09:41,265 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 598 transitions. Word has length 164 [2024-11-08 17:09:41,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:41,266 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 598 transitions. [2024-11-08 17:09:41,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:41,266 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 598 transitions. [2024-11-08 17:09:41,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-08 17:09:41,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:41,269 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:41,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-08 17:09:41,270 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:41,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:41,271 INFO L85 PathProgramCache]: Analyzing trace with hash -2036770732, now seen corresponding path program 1 times [2024-11-08 17:09:41,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:41,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375419876] [2024-11-08 17:09:41,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:41,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:41,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:41,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:41,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:41,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:41,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:41,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:41,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:41,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:41,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:41,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:41,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:41,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:41,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:41,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:41,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375419876] [2024-11-08 17:09:41,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375419876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:41,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:41,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:09:41,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139259144] [2024-11-08 17:09:41,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:41,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:09:41,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:41,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:09:41,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:41,549 INFO L87 Difference]: Start difference. First operand 433 states and 598 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:41,627 INFO L93 Difference]: Finished difference Result 865 states and 1195 transitions. [2024-11-08 17:09:41,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:09:41,628 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 165 [2024-11-08 17:09:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:41,631 INFO L225 Difference]: With dead ends: 865 [2024-11-08 17:09:41,631 INFO L226 Difference]: Without dead ends: 435 [2024-11-08 17:09:41,632 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:09:41,633 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 2 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:41,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 468 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:09:41,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-11-08 17:09:41,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 433. [2024-11-08 17:09:41,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 350 states have (on average 1.2742857142857142) internal successors, (446), 352 states have internal predecessors, (446), 74 states have call successors, (74), 8 states have call predecessors, (74), 8 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-08 17:09:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 594 transitions. [2024-11-08 17:09:41,672 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 594 transitions. Word has length 165 [2024-11-08 17:09:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:41,673 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 594 transitions. [2024-11-08 17:09:41,673 INFO L472 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, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:41,673 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 594 transitions. [2024-11-08 17:09:41,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 17:09:41,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:41,676 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:41,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 17:09:41,676 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:41,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:41,677 INFO L85 PathProgramCache]: Analyzing trace with hash -2083536958, now seen corresponding path program 1 times [2024-11-08 17:09:41,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:41,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333787123] [2024-11-08 17:09:41,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:41,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:42,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:42,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:42,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:42,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:42,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:42,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:42,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:42,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:42,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:42,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:42,518 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:42,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:42,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333787123] [2024-11-08 17:09:42,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333787123] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:42,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:42,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 17:09:42,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231930309] [2024-11-08 17:09:42,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:42,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:09:42,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:42,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:09:42,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:09:42,522 INFO L87 Difference]: Start difference. First operand 433 states and 594 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:42,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:42,924 INFO L93 Difference]: Finished difference Result 1084 states and 1487 transitions. [2024-11-08 17:09:42,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:09:42,925 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2024-11-08 17:09:42,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:42,929 INFO L225 Difference]: With dead ends: 1084 [2024-11-08 17:09:42,929 INFO L226 Difference]: Without dead ends: 654 [2024-11-08 17:09:42,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:09:42,931 INFO L432 NwaCegarLoop]: 285 mSDtfsCounter, 129 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1345 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:42,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1345 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:09:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2024-11-08 17:09:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 649. [2024-11-08 17:09:42,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 526 states have (on average 1.2699619771863118) internal successors, (668), 530 states have internal predecessors, (668), 110 states have call successors, (110), 12 states have call predecessors, (110), 12 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 17:09:42,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 888 transitions. [2024-11-08 17:09:42,997 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 888 transitions. Word has length 166 [2024-11-08 17:09:42,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:42,998 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 888 transitions. [2024-11-08 17:09:42,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 7 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:42,998 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 888 transitions. [2024-11-08 17:09:43,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 17:09:43,002 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:43,002 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:43,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-08 17:09:43,002 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:43,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:43,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1942988348, now seen corresponding path program 1 times [2024-11-08 17:09:43,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:43,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985956905] [2024-11-08 17:09:43,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:43,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:44,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:44,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:44,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:44,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:44,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:44,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:44,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:44,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:44,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:44,389 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:44,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:44,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985956905] [2024-11-08 17:09:44,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985956905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:44,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:44,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:09:44,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663995639] [2024-11-08 17:09:44,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:44,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:09:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:44,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:09:44,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:09:44,392 INFO L87 Difference]: Start difference. First operand 649 states and 888 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:45,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:45,392 INFO L93 Difference]: Finished difference Result 1509 states and 2068 transitions. [2024-11-08 17:09:45,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:09:45,393 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 166 [2024-11-08 17:09:45,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:45,399 INFO L225 Difference]: With dead ends: 1509 [2024-11-08 17:09:45,399 INFO L226 Difference]: Without dead ends: 863 [2024-11-08 17:09:45,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:09:45,402 INFO L432 NwaCegarLoop]: 249 mSDtfsCounter, 132 mSDsluCounter, 986 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1235 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:45,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1235 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-08 17:09:45,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2024-11-08 17:09:45,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 687. [2024-11-08 17:09:45,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 564 states have (on average 1.2801418439716312) internal successors, (722), 568 states have internal predecessors, (722), 110 states have call successors, (110), 12 states have call predecessors, (110), 12 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 17:09:45,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 942 transitions. [2024-11-08 17:09:45,477 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 942 transitions. Word has length 166 [2024-11-08 17:09:45,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:45,477 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 942 transitions. [2024-11-08 17:09:45,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 942 transitions. [2024-11-08 17:09:45,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 17:09:45,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:45,481 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:45,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-08 17:09:45,481 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:45,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:45,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1340861698, now seen corresponding path program 1 times [2024-11-08 17:09:45,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:45,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567102625] [2024-11-08 17:09:45,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:45,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:45,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:45,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:45,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:45,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:45,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:45,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:45,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:45,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:45,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:45,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:45,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:45,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:45,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567102625] [2024-11-08 17:09:45,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567102625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:45,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:45,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:09:45,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268252167] [2024-11-08 17:09:45,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:45,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:09:45,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:45,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:09:45,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:09:45,953 INFO L87 Difference]: Start difference. First operand 687 states and 942 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:09:46,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:46,346 INFO L93 Difference]: Finished difference Result 1921 states and 2622 transitions. [2024-11-08 17:09:46,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:09:46,347 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 166 [2024-11-08 17:09:46,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:46,354 INFO L225 Difference]: With dead ends: 1921 [2024-11-08 17:09:46,354 INFO L226 Difference]: Without dead ends: 1237 [2024-11-08 17:09:46,356 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:09:46,357 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 121 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:46,357 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 666 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:09:46,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2024-11-08 17:09:46,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1229. [2024-11-08 17:09:46,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 1010 states have (on average 1.2712871287128713) internal successors, (1284), 1020 states have internal predecessors, (1284), 194 states have call successors, (194), 24 states have call predecessors, (194), 24 states have return successors, (194), 184 states have call predecessors, (194), 194 states have call successors, (194) [2024-11-08 17:09:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 1672 transitions. [2024-11-08 17:09:46,502 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 1672 transitions. Word has length 166 [2024-11-08 17:09:46,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:46,503 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 1672 transitions. [2024-11-08 17:09:46,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:09:46,503 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 1672 transitions. [2024-11-08 17:09:46,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 17:09:46,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:46,507 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:46,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-08 17:09:46,507 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:46,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:46,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1842505858, now seen corresponding path program 1 times [2024-11-08 17:09:46,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:46,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790257215] [2024-11-08 17:09:46,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:46,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:46,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:46,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:46,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:46,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:46,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:46,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:46,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:46,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:46,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:46,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:46,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:46,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:46,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:46,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:46,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:46,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:46,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790257215] [2024-11-08 17:09:46,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790257215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:46,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:46,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:09:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883488350] [2024-11-08 17:09:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:46,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:09:46,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:46,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:09:46,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:09:46,943 INFO L87 Difference]: Start difference. First operand 1229 states and 1672 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:09:47,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:47,379 INFO L93 Difference]: Finished difference Result 2487 states and 3366 transitions. [2024-11-08 17:09:47,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:09:47,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 166 [2024-11-08 17:09:47,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:47,387 INFO L225 Difference]: With dead ends: 2487 [2024-11-08 17:09:47,387 INFO L226 Difference]: Without dead ends: 1261 [2024-11-08 17:09:47,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:09:47,391 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 120 mSDsluCounter, 827 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1094 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:47,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1094 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:09:47,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2024-11-08 17:09:47,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 739. [2024-11-08 17:09:47,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 610 states have (on average 1.2655737704918033) internal successors, (772), 614 states have internal predecessors, (772), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 17:09:47,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 992 transitions. [2024-11-08 17:09:47,484 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 992 transitions. Word has length 166 [2024-11-08 17:09:47,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:47,485 INFO L471 AbstractCegarLoop]: Abstraction has 739 states and 992 transitions. [2024-11-08 17:09:47,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:09:47,486 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 992 transitions. [2024-11-08 17:09:47,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-08 17:09:47,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:47,488 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:47,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-08 17:09:47,488 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:47,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:47,489 INFO L85 PathProgramCache]: Analyzing trace with hash 831388608, now seen corresponding path program 1 times [2024-11-08 17:09:47,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:47,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513771736] [2024-11-08 17:09:47,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:47,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:47,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:48,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:48,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:48,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:48,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:48,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:48,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:48,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:48,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:48,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:48,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:48,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:48,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:48,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:48,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:48,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:48,944 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:48,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:48,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513771736] [2024-11-08 17:09:48,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1513771736] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:48,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:48,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-08 17:09:48,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271884603] [2024-11-08 17:09:48,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:48,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:09:48,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:48,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:09:48,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:09:48,947 INFO L87 Difference]: Start difference. First operand 739 states and 992 transitions. Second operand has 10 states, 8 states have (on average 8.0) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 17:09:50,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:50,258 INFO L93 Difference]: Finished difference Result 1635 states and 2198 transitions. [2024-11-08 17:09:50,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 17:09:50,259 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 8.0) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) Word has length 166 [2024-11-08 17:09:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:50,265 INFO L225 Difference]: With dead ends: 1635 [2024-11-08 17:09:50,266 INFO L226 Difference]: Without dead ends: 899 [2024-11-08 17:09:50,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:09:50,270 INFO L432 NwaCegarLoop]: 283 mSDtfsCounter, 127 mSDsluCounter, 1559 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1842 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:50,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 1842 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-08 17:09:50,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2024-11-08 17:09:50,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 729. [2024-11-08 17:09:50,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 600 states have (on average 1.2633333333333334) internal successors, (758), 604 states have internal predecessors, (758), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 17:09:50,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 978 transitions. [2024-11-08 17:09:50,396 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 978 transitions. Word has length 166 [2024-11-08 17:09:50,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:50,397 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 978 transitions. [2024-11-08 17:09:50,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 8.0) internal successors, (64), 10 states have internal predecessors, (64), 3 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 17:09:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 978 transitions. [2024-11-08 17:09:50,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 17:09:50,401 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:50,401 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:50,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-08 17:09:50,402 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:50,402 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:50,402 INFO L85 PathProgramCache]: Analyzing trace with hash 2099508621, now seen corresponding path program 1 times [2024-11-08 17:09:50,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:50,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541223758] [2024-11-08 17:09:50,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:50,403 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:50,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:51,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:51,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:51,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:51,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:51,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:51,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:51,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:51,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:51,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:51,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:51,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:51,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:51,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:51,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541223758] [2024-11-08 17:09:52,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541223758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:52,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:52,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:09:52,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722449041] [2024-11-08 17:09:52,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:52,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:09:52,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:52,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:09:52,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:09:52,002 INFO L87 Difference]: Start difference. First operand 729 states and 978 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:09:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:52,506 INFO L93 Difference]: Finished difference Result 1713 states and 2278 transitions. [2024-11-08 17:09:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-08 17:09:52,507 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) Word has length 167 [2024-11-08 17:09:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:52,514 INFO L225 Difference]: With dead ends: 1713 [2024-11-08 17:09:52,514 INFO L226 Difference]: Without dead ends: 987 [2024-11-08 17:09:52,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-08 17:09:52,517 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 42 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1140 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:52,518 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1140 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:09:52,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 987 states. [2024-11-08 17:09:52,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 987 to 811. [2024-11-08 17:09:52,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 682 states have (on average 1.252199413489736) internal successors, (854), 686 states have internal predecessors, (854), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 17:09:52,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1074 transitions. [2024-11-08 17:09:52,605 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1074 transitions. Word has length 167 [2024-11-08 17:09:52,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:52,606 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1074 transitions. [2024-11-08 17:09:52,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 2 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:09:52,606 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1074 transitions. [2024-11-08 17:09:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 17:09:52,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:52,609 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:52,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-08 17:09:52,609 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:52,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:52,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1551888033, now seen corresponding path program 1 times [2024-11-08 17:09:52,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:52,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233017959] [2024-11-08 17:09:52,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:52,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:52,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:53,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:53,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:53,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:53,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:53,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:53,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:53,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:53,274 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:53,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:53,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233017959] [2024-11-08 17:09:53,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233017959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:53,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:53,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:09:53,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804814638] [2024-11-08 17:09:53,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:53,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:09:53,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:53,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:09:53,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:09:53,277 INFO L87 Difference]: Start difference. First operand 811 states and 1074 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:53,505 INFO L93 Difference]: Finished difference Result 1651 states and 2191 transitions. [2024-11-08 17:09:53,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:09:53,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2024-11-08 17:09:53,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:53,511 INFO L225 Difference]: With dead ends: 1651 [2024-11-08 17:09:53,511 INFO L226 Difference]: Without dead ends: 843 [2024-11-08 17:09:53,513 INFO L431 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 [2024-11-08 17:09:53,514 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 91 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:53,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 455 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:09:53,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2024-11-08 17:09:53,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 811. [2024-11-08 17:09:53,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 811 states, 682 states have (on average 1.2434017595307918) internal successors, (848), 686 states have internal predecessors, (848), 110 states have call successors, (110), 18 states have call predecessors, (110), 18 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-08 17:09:53,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 811 states to 811 states and 1068 transitions. [2024-11-08 17:09:53,598 INFO L78 Accepts]: Start accepts. Automaton has 811 states and 1068 transitions. Word has length 167 [2024-11-08 17:09:53,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:53,599 INFO L471 AbstractCegarLoop]: Abstraction has 811 states and 1068 transitions. [2024-11-08 17:09:53,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:09:53,599 INFO L276 IsEmpty]: Start isEmpty. Operand 811 states and 1068 transitions. [2024-11-08 17:09:53,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-08 17:09:53,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:53,602 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:53,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-08 17:09:53,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:53,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:53,607 INFO L85 PathProgramCache]: Analyzing trace with hash 410564879, now seen corresponding path program 1 times [2024-11-08 17:09:53,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:53,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339281035] [2024-11-08 17:09:53,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:53,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:09:53,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793840614] [2024-11-08 17:09:53,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:53,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:09:53,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:09:53,780 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:09:53,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 17:09:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:54,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-08 17:09:54,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:09:54,293 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 15 treesize of output 1 [2024-11-08 17:09:54,300 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 19 treesize of output 1 [2024-11-08 17:09:54,305 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 19 treesize of output 1 [2024-11-08 17:09:54,319 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 19 treesize of output 1 [2024-11-08 17:09:54,334 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 15 treesize of output 1 [2024-11-08 17:09:54,409 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 17 treesize of output 13 [2024-11-08 17:09:55,711 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 132 treesize of output 84 [2024-11-08 17:09:55,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:09:55,736 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 148 treesize of output 70 [2024-11-08 17:09:55,751 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 75 treesize of output 51 [2024-11-08 17:09:56,112 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-08 17:09:56,113 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:09:56,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:56,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339281035] [2024-11-08 17:09:56,114 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-08 17:09:56,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793840614] [2024-11-08 17:09:56,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793840614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:56,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:56,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-08 17:09:56,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702304972] [2024-11-08 17:09:56,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:56,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-08 17:09:56,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:56,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-08 17:09:56,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-08 17:09:56,117 INFO L87 Difference]: Start difference. First operand 811 states and 1068 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:09:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:09:58,968 INFO L93 Difference]: Finished difference Result 1771 states and 2326 transitions. [2024-11-08 17:09:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-08 17:09:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 167 [2024-11-08 17:09:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:09:58,974 INFO L225 Difference]: With dead ends: 1771 [2024-11-08 17:09:58,975 INFO L226 Difference]: Without dead ends: 963 [2024-11-08 17:09:58,977 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=113, Invalid=393, Unknown=0, NotChecked=0, Total=506 [2024-11-08 17:09:58,978 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 304 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-08 17:09:58,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [349 Valid, 1340 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-08 17:09:58,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-08 17:09:59,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 617. [2024-11-08 17:09:59,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 528 states have (on average 1.2481060606060606) internal successors, (659), 530 states have internal predecessors, (659), 74 states have call successors, (74), 14 states have call predecessors, (74), 14 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-08 17:09:59,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 807 transitions. [2024-11-08 17:09:59,090 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 807 transitions. Word has length 167 [2024-11-08 17:09:59,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:09:59,090 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 807 transitions. [2024-11-08 17:09:59,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 11 states have internal predecessors, (68), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:09:59,091 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 807 transitions. [2024-11-08 17:09:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-08 17:09:59,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:09:59,094 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:09:59,119 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 17:09:59,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-08 17:09:59,296 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:09:59,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:09:59,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1997256719, now seen corresponding path program 1 times [2024-11-08 17:09:59,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:09:59,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151230324] [2024-11-08 17:09:59,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:09:59,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:09:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:09:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:09:59,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:09:59,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:09:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:09:59,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:09:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:09:59,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:09:59,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:09:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:09:59,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:09:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:09:59,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:09:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:09:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:09:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:09:59,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:09:59,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:09:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:09:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:09:59,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:09:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:09:59,721 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:09:59,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:09:59,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151230324] [2024-11-08 17:09:59,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151230324] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:09:59,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:09:59,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:09:59,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111517430] [2024-11-08 17:09:59,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:09:59,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:09:59,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:09:59,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:09:59,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:09:59,725 INFO L87 Difference]: Start difference. First operand 617 states and 807 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:10:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:10:00,057 INFO L93 Difference]: Finished difference Result 1273 states and 1676 transitions. [2024-11-08 17:10:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:10:00,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 169 [2024-11-08 17:10:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:10:00,063 INFO L225 Difference]: With dead ends: 1273 [2024-11-08 17:10:00,063 INFO L226 Difference]: Without dead ends: 943 [2024-11-08 17:10:00,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:10:00,065 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 154 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 557 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.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:10:00,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 557 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:10:00,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-08 17:10:00,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 906. [2024-11-08 17:10:00,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 773 states have (on average 1.241914618369987) internal successors, (960), 776 states have internal predecessors, (960), 111 states have call successors, (111), 21 states have call predecessors, (111), 21 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-08 17:10:00,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1182 transitions. [2024-11-08 17:10:00,168 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1182 transitions. Word has length 169 [2024-11-08 17:10:00,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:10:00,169 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1182 transitions. [2024-11-08 17:10:00,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:10:00,169 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1182 transitions. [2024-11-08 17:10:00,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 17:10:00,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:00,172 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:10:00,172 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-08 17:10:00,172 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:10:00,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:00,173 INFO L85 PathProgramCache]: Analyzing trace with hash 2078546233, now seen corresponding path program 1 times [2024-11-08 17:10:00,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:10:00,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495489418] [2024-11-08 17:10:00,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:00,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:10:00,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:10:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:10:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:10:00,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,590 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:10:00,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:10:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:10:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:10:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:10:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:10:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:10:00,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:10:00,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:10:00,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:10:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:10:00,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:10:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:10:00,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:10:00,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:10:00,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:10:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:10:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:10:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:10:00,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:10:00,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495489418] [2024-11-08 17:10:00,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495489418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:10:00,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:10:00,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:10:00,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649009325] [2024-11-08 17:10:00,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:10:00,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:10:00,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:10:00,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:10:00,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:10:00,644 INFO L87 Difference]: Start difference. First operand 906 states and 1182 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:10:00,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:10:00,936 INFO L93 Difference]: Finished difference Result 1562 states and 2046 transitions. [2024-11-08 17:10:00,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:10:00,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2024-11-08 17:10:00,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:10:00,943 INFO L225 Difference]: With dead ends: 1562 [2024-11-08 17:10:00,943 INFO L226 Difference]: Without dead ends: 943 [2024-11-08 17:10:00,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:10:00,945 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 147 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 17:10:00,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 635 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 17:10:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2024-11-08 17:10:01,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 622. [2024-11-08 17:10:01,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 622 states, 533 states have (on average 1.2457786116322702) internal successors, (664), 535 states have internal predecessors, (664), 74 states have call successors, (74), 14 states have call predecessors, (74), 14 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-08 17:10:01,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 812 transitions. [2024-11-08 17:10:01,023 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 812 transitions. Word has length 171 [2024-11-08 17:10:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:10:01,024 INFO L471 AbstractCegarLoop]: Abstraction has 622 states and 812 transitions. [2024-11-08 17:10:01,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:10:01,025 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 812 transitions. [2024-11-08 17:10:01,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 17:10:01,026 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:01,026 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:10:01,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-08 17:10:01,027 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:10:01,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:01,027 INFO L85 PathProgramCache]: Analyzing trace with hash 525714921, now seen corresponding path program 1 times [2024-11-08 17:10:01,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:10:01,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232214877] [2024-11-08 17:10:01,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:01,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:10:01,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:10:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:10:01,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:10:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:10:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:10:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:10:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:10:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:10:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:10:01,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:10:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:10:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:10:01,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:10:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:10:01,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:10:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:10:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:10:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:10:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:10:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:10:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:10:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:10:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:10:01,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232214877] [2024-11-08 17:10:01,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232214877] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:10:01,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:10:01,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:10:01,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756041523] [2024-11-08 17:10:01,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:10:01,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:10:01,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:10:01,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:10:01,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:10:01,453 INFO L87 Difference]: Start difference. First operand 622 states and 812 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:10:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:10:01,851 INFO L93 Difference]: Finished difference Result 1582 states and 2067 transitions. [2024-11-08 17:10:01,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:10:01,852 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2024-11-08 17:10:01,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:10:01,858 INFO L225 Difference]: With dead ends: 1582 [2024-11-08 17:10:01,858 INFO L226 Difference]: Without dead ends: 963 [2024-11-08 17:10:01,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:10:01,861 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 155 mSDsluCounter, 635 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 17:10:01,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 804 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 17:10:01,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-08 17:10:01,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 916. [2024-11-08 17:10:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 916 states, 783 states have (on average 1.2388250319284801) internal successors, (970), 786 states have internal predecessors, (970), 111 states have call successors, (111), 21 states have call predecessors, (111), 21 states have return successors, (111), 108 states have call predecessors, (111), 111 states have call successors, (111) [2024-11-08 17:10:01,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 916 states to 916 states and 1192 transitions. [2024-11-08 17:10:01,978 INFO L78 Accepts]: Start accepts. Automaton has 916 states and 1192 transitions. Word has length 171 [2024-11-08 17:10:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:10:01,979 INFO L471 AbstractCegarLoop]: Abstraction has 916 states and 1192 transitions. [2024-11-08 17:10:01,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:10:01,979 INFO L276 IsEmpty]: Start isEmpty. Operand 916 states and 1192 transitions. [2024-11-08 17:10:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 17:10:01,980 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:01,981 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:10:01,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-08 17:10:01,981 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:10:01,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:01,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1279723413, now seen corresponding path program 1 times [2024-11-08 17:10:01,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:10:01,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294903455] [2024-11-08 17:10:01,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:01,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:10:02,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,509 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 17:10:02,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 17:10:02,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,513 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 17:10:02,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-08 17:10:02,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-08 17:10:02,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-08 17:10:02,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-08 17:10:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-08 17:10:02,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-08 17:10:02,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 17:10:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 17:10:02,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 17:10:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-08 17:10:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-08 17:10:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-08 17:10:02,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-08 17:10:02,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-08 17:10:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-08 17:10:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-08 17:10:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-08 17:10:02,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 17:10:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:02,566 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:10:02,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:10:02,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294903455] [2024-11-08 17:10:02,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294903455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:10:02,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:10:02,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:10:02,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579236553] [2024-11-08 17:10:02,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:10:02,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:10:02,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:10:02,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:10:02,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:10:02,570 INFO L87 Difference]: Start difference. First operand 916 states and 1192 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:10:03,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:10:03,283 INFO L93 Difference]: Finished difference Result 2092 states and 2734 transitions. [2024-11-08 17:10:03,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:10:03,284 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 171 [2024-11-08 17:10:03,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:10:03,291 INFO L225 Difference]: With dead ends: 2092 [2024-11-08 17:10:03,291 INFO L226 Difference]: Without dead ends: 1179 [2024-11-08 17:10:03,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:10:03,294 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 293 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 735 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 17:10:03,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 735 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 17:10:03,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2024-11-08 17:10:03,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 1132. [2024-11-08 17:10:03,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1132 states, 955 states have (on average 1.236649214659686) internal successors, (1181), 959 states have internal predecessors, (1181), 148 states have call successors, (148), 28 states have call predecessors, (148), 28 states have return successors, (148), 144 states have call predecessors, (148), 148 states have call successors, (148) [2024-11-08 17:10:03,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1132 states to 1132 states and 1477 transitions. [2024-11-08 17:10:03,445 INFO L78 Accepts]: Start accepts. Automaton has 1132 states and 1477 transitions. Word has length 171 [2024-11-08 17:10:03,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:10:03,446 INFO L471 AbstractCegarLoop]: Abstraction has 1132 states and 1477 transitions. [2024-11-08 17:10:03,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:10:03,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1477 transitions. [2024-11-08 17:10:03,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-08 17:10:03,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:03,448 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:10:03,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-08 17:10:03,449 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:10:03,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:03,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1827344001, now seen corresponding path program 1 times [2024-11-08 17:10:03,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:10:03,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848573653] [2024-11-08 17:10:03,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:03,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:10:03,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 17:10:03,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [635161668] [2024-11-08 17:10:03,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:03,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:10:03,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:10:03,554 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:10:03,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-08 17:10:04,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:10:04,065 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:10:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:10:04,563 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:10:04,563 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:10:04,564 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:10:04,579 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-08 17:10:04,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:10:04,771 INFO L407 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] [2024-11-08 17:10:04,921 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:10:04,926 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:10:04 BoogieIcfgContainer [2024-11-08 17:10:04,927 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:10:04,927 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:10:04,928 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:10:04,928 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:10:04,928 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:09:34" (3/4) ... [2024-11-08 17:10:04,931 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:10:04,933 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:10:04,934 INFO L158 Benchmark]: Toolchain (without parser) took 32443.99ms. Allocated memory was 167.8MB in the beginning and 511.7MB in the end (delta: 343.9MB). Free memory was 135.3MB in the beginning and 181.4MB in the end (delta: -46.1MB). Peak memory consumption was 297.4MB. Max. memory is 16.1GB. [2024-11-08 17:10:04,934 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 121.6MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:10:04,935 INFO L158 Benchmark]: CACSL2BoogieTranslator took 517.98ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 127.8MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 17:10:04,935 INFO L158 Benchmark]: Boogie Procedure Inliner took 123.60ms. Allocated memory is still 167.8MB. Free memory was 127.8MB in the beginning and 122.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:10:04,936 INFO L158 Benchmark]: Boogie Preprocessor took 128.87ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 118.0MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 17:10:04,936 INFO L158 Benchmark]: RCFGBuilder took 1040.19ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 80.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-08 17:10:04,936 INFO L158 Benchmark]: TraceAbstraction took 30616.25ms. Allocated memory was 167.8MB in the beginning and 511.7MB in the end (delta: 343.9MB). Free memory was 79.6MB in the beginning and 181.4MB in the end (delta: -101.8MB). Peak memory consumption was 244.6MB. Max. memory is 16.1GB. [2024-11-08 17:10:04,939 INFO L158 Benchmark]: Witness Printer took 5.53ms. Allocated memory is still 511.7MB. Free memory is still 181.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:10:04,940 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.30ms. Allocated memory is still 121.6MB. Free memory is still 89.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 517.98ms. Allocated memory is still 167.8MB. Free memory was 134.6MB in the beginning and 127.8MB in the end (delta: 6.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 123.60ms. Allocated memory is still 167.8MB. Free memory was 127.8MB in the beginning and 122.9MB in the end (delta: 4.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 128.87ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 118.0MB in the end (delta: 4.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1040.19ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 80.3MB in the end (delta: 37.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 30616.25ms. Allocated memory was 167.8MB in the beginning and 511.7MB in the end (delta: 343.9MB). Free memory was 79.6MB in the beginning and 181.4MB in the end (delta: -101.8MB). Peak memory consumption was 244.6MB. Max. memory is 16.1GB. * Witness Printer took 5.53ms. Allocated memory is still 511.7MB. Free memory is still 181.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - 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 105, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someUnaryFLOAToperation at line 105. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L22-L24] unsigned char BOOL_unsigned_char_Array_0[2][3] = { {0, 1, 0}, {0, 0, 0} }; [L25-L27] double double_Array_0[1] = { 10.5 }; [L25-L27] double double_Array_0[1] = { 10.5 }; [L28-L30] float float_Array_0[2] = { 50.75, 32.6 }; [L28-L30] float float_Array_0[2] = { 50.75, 32.6 }; [L28-L30] float float_Array_0[2] = { 50.75, 32.6 }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L31-L33] signed char signed_char_Array_0[2][2] = { {50, -64}, {-1, -25} }; [L34-L36] signed long int signed_long_int_Array_0[1] = { 32 }; [L34-L36] signed long int signed_long_int_Array_0[1] = { 32 }; [L37-L39] unsigned char unsigned_char_Array_0[1] = { 1 }; [L37-L39] unsigned char unsigned_char_Array_0[1] = { 1 }; VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=0, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L109] isInitial = 1 [L110] FCALL initially() [L111] COND TRUE 1 [L112] FCALL updateLastVariables() [L113] CALL updateVariables() [L69] BOOL_unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L70] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L70] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L70] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] >= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] EXPR BOOL_unsigned_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L71] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][0] <= 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L72] BOOL_unsigned_char_Array_0[1][1] = __VERIFIER_nondet_uchar() [L73] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L73] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L73] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] EXPR BOOL_unsigned_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] CALL assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L74] RET assume_abort_if_not(BOOL_unsigned_char_Array_0[1][1] <= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L75] BOOL_unsigned_char_Array_0[0][2] = __VERIFIER_nondet_uchar() [L76] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L76] 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}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L76] 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}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] EXPR BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] 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}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L77] 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}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L78] BOOL_unsigned_char_Array_0[1][2] = __VERIFIER_nondet_uchar() [L79] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] 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}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L79] 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}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] EXPR BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] 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}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L80] 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}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L81] double_Array_0[0] = __VERIFIER_nondet_double() [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F [L82] EXPR double_Array_0[0] [L82] EXPR double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] EXPR (double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] CALL assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L82] RET assume_abort_if_not((double_Array_0[0] >= 0.0F && double_Array_0[0] <= -1.0e-20F) || (double_Array_0[0] <= 9223372.036854776000e+12F && double_Array_0[0] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L83] float_Array_0[1] = __VERIFIER_nondet_float() [L84] EXPR float_Array_0[1] [L84] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F [L84] EXPR float_Array_0[1] [L84] EXPR float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] EXPR (float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F ) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] CALL assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L84] RET assume_abort_if_not((float_Array_0[1] >= -922337.2036854765600e+13F && float_Array_0[1] <= -1.0e-20F) || (float_Array_0[1] <= 9223372.036854765600e+12F && float_Array_0[1] >= 1.0e-20F )) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L85] signed_char_Array_0[0][0] = __VERIFIER_nondet_char() [L86] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] CALL assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L86] RET assume_abort_if_not(signed_char_Array_0[0][0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] CALL assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L87] RET assume_abort_if_not(signed_char_Array_0[0][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L88] signed_char_Array_0[1][0] = __VERIFIER_nondet_char() [L89] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] CALL assume_abort_if_not(signed_char_Array_0[1][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L89] RET assume_abort_if_not(signed_char_Array_0[1][0] >= -1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] EXPR signed_char_Array_0[1][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] CALL assume_abort_if_not(signed_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L90] RET assume_abort_if_not(signed_char_Array_0[1][0] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L91] signed_char_Array_0[0][1] = __VERIFIER_nondet_char() [L92] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] CALL assume_abort_if_not(signed_char_Array_0[0][1] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L92] RET assume_abort_if_not(signed_char_Array_0[0][1] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] CALL assume_abort_if_not(signed_char_Array_0[0][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L93] RET assume_abort_if_not(signed_char_Array_0[0][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L94] signed_char_Array_0[1][1] = __VERIFIER_nondet_char() [L95] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] CALL assume_abort_if_not(signed_char_Array_0[1][1] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L95] RET assume_abort_if_not(signed_char_Array_0[1][1] >= -128) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] CALL assume_abort_if_not(signed_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L96] RET assume_abort_if_not(signed_char_Array_0[1][1] <= 127) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L97] unsigned_char_Array_0[0] = __VERIFIER_nondet_uchar() [L98] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] CALL assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L98] RET assume_abort_if_not(unsigned_char_Array_0[0] >= 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] CALL assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L99] RET assume_abort_if_not(unsigned_char_Array_0[0] <= 255) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L100] EXPR unsigned_char_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L100] CALL assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L20] COND FALSE !(!cond) VAL [BOOL_unsigned_char_Array_0={4:0}, \old(cond)=1, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L100] RET assume_abort_if_not(unsigned_char_Array_0[0] != 0) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L113] RET updateVariables() [L114] CALL step() [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR signed_char_Array_0[1][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L43] EXPR ((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]) [L43] EXPR signed_char_Array_0[0][1] [L43] EXPR ((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L43] EXPR unsigned_char_Array_0[0] [L43] signed long int stepLocal_1 = ((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]; [L44] EXPR signed_char_Array_0[1][0] [L44] EXPR signed_char_Array_0[0][0] [L44] signed long int stepLocal_0 = signed_char_Array_0[1][0] - signed_char_Array_0[0][0]; [L45] EXPR signed_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L45] COND FALSE !(signed_char_Array_0[0][1] > stepLocal_0) [L50] EXPR signed_char_Array_0[1][1] [L50] signed_long_int_Array_0[0] = signed_char_Array_0[1][1] [L52] EXPR float_Array_0[1] [L52] float_Array_0[0] = float_Array_0[1] [L53] EXPR double_Array_0[0] [L53] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L53] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L53] EXPR float_Array_0[0] [L53] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=1, unsigned_char_Array_0={9:0}] [L53] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L53] COND TRUE (double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0] [L54] EXPR signed_char_Array_0[0][0] [L54] EXPR signed_long_int_Array_0[0] [L54] EXPR (signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=1, unsigned_char_Array_0={9:0}] [L54] EXPR (signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2] [L54] EXPR BOOL_unsigned_char_Array_0[1][2] [L54] EXPR (signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=1, unsigned_char_Array_0={9:0}] [L54] EXPR ((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=1, unsigned_char_Array_0={9:0}] [L54] EXPR ((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2]) [L54] EXPR BOOL_unsigned_char_Array_0[1][1] [L54] EXPR BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=1, unsigned_char_Array_0={9:0}] [L54] EXPR BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2] [L54] EXPR BOOL_unsigned_char_Array_0[0][2] [L54] EXPR BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=1, unsigned_char_Array_0={9:0}] [L54] EXPR ((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, stepLocal_1=1, unsigned_char_Array_0={9:0}] [L54] BOOL_unsigned_char_Array_0[0][1] = (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])) [L56] EXPR signed_long_int_Array_0[0] [L56] signed long int stepLocal_3 = signed_long_int_Array_0[0]; [L57] EXPR signed_long_int_Array_0[0] [L57] EXPR signed_long_int_Array_0[0] [L57] EXPR signed_char_Array_0[0][0] [L57] signed long int stepLocal_2 = signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]); [L58] BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L58] COND FALSE !(BOOL_unsigned_char_Array_0[0][1]) [L114] RET step() [L115] CALL, EXPR property() [L105] EXPR signed_char_Array_0[0][1] [L105] EXPR signed_char_Array_0[1][0] [L105] EXPR signed_char_Array_0[0][0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1])) [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR signed_char_Array_0[1][1] [L105] EXPR (signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1) [L105] EXPR BOOL_unsigned_char_Array_0[0][1] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1 [L105] EXPR BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1) [L105] EXPR double_Array_0[0] [L105] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) [L105] EXPR float_Array_0[0] [L105] EXPR ((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0]) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR float_Array_0[0] VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1 [L105] EXPR ((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1 VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR (((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105] EXPR ((((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) [L105] EXPR float_Array_0[0] [L105] EXPR float_Array_0[1] [L105] EXPR ((((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L105-L106] return ((((signed_char_Array_0[0][1] > (signed_char_Array_0[1][0] - signed_char_Array_0[0][0])) ? (((((((signed_char_Array_0[0][1]) < (signed_char_Array_0[1][1])) ? (signed_char_Array_0[0][1]) : (signed_char_Array_0[1][1]))) / unsigned_char_Array_0[0]) <= signed_char_Array_0[0][0]) ? (signed_long_int_Array_0[0] == ((signed long int) unsigned_char_Array_0[0])) : 1) : (signed_long_int_Array_0[0] == ((signed long int) signed_char_Array_0[1][1]))) && (BOOL_unsigned_char_Array_0[0][1] ? ((signed_long_int_Array_0[0] > signed_long_int_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) (! BOOL_unsigned_char_Array_0[1][0]))) : (((signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < (signed_long_int_Array_0[0] * (signed_long_int_Array_0[0] * signed_char_Array_0[0][0]))) ? (BOOL_unsigned_char_Array_0[0][0] == ((unsigned char) BOOL_unsigned_char_Array_0[1][0])) : 1)) : 1)) && (((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) ? (BOOL_unsigned_char_Array_0[0][1] == ((unsigned char) (((signed_char_Array_0[0][0] < signed_long_int_Array_0[0]) && BOOL_unsigned_char_Array_0[1][2]) || (BOOL_unsigned_char_Array_0[1][1] || BOOL_unsigned_char_Array_0[0][2])))) : 1)) && (float_Array_0[0] == ((float) float_Array_0[1])) ; [L115] RET, EXPR property() [L115] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] [L19] reach_error() VAL [BOOL_unsigned_char_Array_0={4:0}, double_Array_0={5:0}, float_Array_0={6:0}, isInitial=1, signed_char_Array_0={7:0}, signed_long_int_Array_0={8:0}, unsigned_char_Array_0={9:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 118 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 30.4s, OverallIterations: 23, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2318 SdHoareTripleChecker+Valid, 6.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2268 mSDsluCounter, 17395 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13102 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3519 IncrementalHoareTripleChecker+Invalid, 3579 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 4293 mSDtfsCounter, 3519 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1246 GetRequests, 1121 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1229occurred in iteration=13, InterpolantAutomatonStates: 150, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 22 MinimizatonAttempts, 1952 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 14.0s InterpolantComputationTime, 4134 NumberOfCodeBlocks, 4134 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3603 ConstructedInterpolants, 0 QuantifiedInterpolants, 10163 SizeOfPredicates, 11 NumberOfNonLiveVariables, 562 ConjunctsInSsa, 43 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 18480/18480 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 [2024-11-08 17:10:04,983 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX --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 eaa60ed61738bb84f21e0e7461cdcc453d531566de1a87a0cbf8ab788e5233b0 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 17:10:07,334 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:10:07,433 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 17:10:07,439 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:10:07,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:10:07,479 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:10:07,480 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:10:07,481 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:10:07,482 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:10:07,483 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:10:07,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:10:07,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:10:07,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:10:07,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:10:07,488 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:10:07,488 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:10:07,489 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:10:07,489 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 17:10:07,490 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 17:10:07,494 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:10:07,494 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:10:07,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:10:07,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:10:07,495 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:10:07,496 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:10:07,496 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:10:07,496 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:10:07,497 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 17:10:07,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:10:07,497 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:10:07,499 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:10:07,500 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:10:07,500 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:10:07,501 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:10:07,501 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:10:07,502 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:10:07,503 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:10:07,504 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:10:07,504 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-08 17:10:07,504 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:10:07,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:10:07,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:10:07,506 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:10:07,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:10:07,519 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_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX 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 -> eaa60ed61738bb84f21e0e7461cdcc453d531566de1a87a0cbf8ab788e5233b0 [2024-11-08 17:10:07,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:10:07,962 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:10:07,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:10:07,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:10:07,968 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:10:07,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i Unable to find full path for "g++" [2024-11-08 17:10:10,275 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:10:10,584 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:10:10,585 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-11-08 17:10:10,599 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/data/95d9c3baf/a31675fd23b14c9aa1fefedeeccb4978/FLAGdb5579fd5 [2024-11-08 17:10:10,618 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/data/95d9c3baf/a31675fd23b14c9aa1fefedeeccb4978 [2024-11-08 17:10:10,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:10:10,623 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:10:10,625 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:10:10,625 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:10:10,632 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:10:10,633 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:10:10" (1/1) ... [2024-11-08 17:10:10,635 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a55780 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:10, skipping insertion in model container [2024-11-08 17:10:10,635 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:10:10" (1/1) ... [2024-11-08 17:10:10,677 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:10:10,906 WARN L250 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_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i[916,929] [2024-11-08 17:10:11,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:10:11,056 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:10:11,077 WARN L250 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_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i[916,929] [2024-11-08 17:10:11,195 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:10:11,228 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:10:11,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11 WrapperNode [2024-11-08 17:10:11,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:10:11,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:10:11,231 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:10:11,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:10:11,240 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (1/1) ... [2024-11-08 17:10:11,309 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (1/1) ... [2024-11-08 17:10:11,402 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2024-11-08 17:10:11,407 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:10:11,408 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:10:11,408 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:10:11,408 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:10:11,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (1/1) ... [2024-11-08 17:10:11,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (1/1) ... [2024-11-08 17:10:11,440 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (1/1) ... [2024-11-08 17:10:11,496 INFO L175 MemorySlicer]: Split 131 memory accesses to 7 slices as follows [2, 36, 8, 19, 38, 17, 11]. 29 percent of accesses are in the largest equivalence class. The 17 initializations are split as follows [2, 6, 1, 2, 4, 1, 1]. The 17 writes are split as follows [0, 7, 1, 2, 4, 2, 1]. [2024-11-08 17:10:11,498 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (1/1) ... [2024-11-08 17:10:11,499 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (1/1) ... [2024-11-08 17:10:11,550 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (1/1) ... [2024-11-08 17:10:11,562 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (1/1) ... [2024-11-08 17:10:11,570 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (1/1) ... [2024-11-08 17:10:11,578 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (1/1) ... [2024-11-08 17:10:11,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:10:11,599 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:10:11,600 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:10:11,600 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:10:11,601 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (1/1) ... [2024-11-08 17:10:11,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:10:11,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:10:11,650 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 17:10:11,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 17:10:11,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:10:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-08 17:10:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-08 17:10:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-08 17:10:11,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-08 17:10:11,700 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-08 17:10:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-08 17:10:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-08 17:10:11,701 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-08 17:10:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-08 17:10:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-08 17:10:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-08 17:10:11,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-08 17:10:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-08 17:10:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-08 17:10:11,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-08 17:10:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-08 17:10:11,704 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-08 17:10:11,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-08 17:10:11,705 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-08 17:10:11,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-08 17:10:11,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-08 17:10:11,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:10:11,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:10:11,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-08 17:10:11,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-08 17:10:11,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-08 17:10:11,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-08 17:10:11,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-08 17:10:11,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-08 17:10:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-08 17:10:11,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-08 17:10:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-08 17:10:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-08 17:10:11,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-08 17:10:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-08 17:10:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-08 17:10:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-08 17:10:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-08 17:10:11,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-08 17:10:11,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-08 17:10:11,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-08 17:10:11,712 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-08 17:10:11,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-08 17:10:11,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-08 17:10:11,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-08 17:10:11,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-08 17:10:11,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-08 17:10:11,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-08 17:10:11,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-08 17:10:11,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-08 17:10:11,714 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-08 17:10:11,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-08 17:10:11,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-08 17:10:11,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-08 17:10:11,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-08 17:10:11,715 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-08 17:10:11,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-08 17:10:11,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-08 17:10:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-08 17:10:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-08 17:10:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-08 17:10:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-08 17:10:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-08 17:10:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-08 17:10:11,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-08 17:10:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-08 17:10:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-08 17:10:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-08 17:10:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-08 17:10:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-08 17:10:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 17:10:11,718 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 17:10:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:10:11,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:10:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-08 17:10:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-08 17:10:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-08 17:10:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-08 17:10:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-08 17:10:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-08 17:10:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-08 17:10:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-08 17:10:11,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-08 17:10:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-08 17:10:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-08 17:10:11,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-08 17:10:11,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-08 17:10:11,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-08 17:10:11,975 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:10:11,994 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:10:18,943 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-08 17:10:18,943 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:10:18,969 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:10:18,969 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:10:18,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:10:18 BoogieIcfgContainer [2024-11-08 17:10:18,970 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:10:18,974 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:10:18,975 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:10:18,978 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:10:18,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:10:10" (1/3) ... [2024-11-08 17:10:18,980 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143f84e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:10:18, skipping insertion in model container [2024-11-08 17:10:18,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:10:11" (2/3) ... [2024-11-08 17:10:18,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@143f84e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:10:18, skipping insertion in model container [2024-11-08 17:10:18,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:10:18" (3/3) ... [2024-11-08 17:10:18,987 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-44.i [2024-11-08 17:10:19,007 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:10:19,007 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:10:19,092 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:10:19,100 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@65d6d1c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:10:19,101 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:10:19,105 INFO L276 IsEmpty]: Start isEmpty. Operand has 118 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 95 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:10:19,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:10:19,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:19,123 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:10:19,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:10:19,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:19,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1626087399, now seen corresponding path program 1 times [2024-11-08 17:10:19,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:10:19,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785667739] [2024-11-08 17:10:19,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:19,143 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 [2024-11-08 17:10:19,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:10:19,147 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:10:19,158 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:19,693 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 17:10:19,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:10:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 244 proven. 0 refuted. 0 times theorem prover too weak. 596 trivial. 0 not checked. [2024-11-08 17:10:19,779 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:10:19,780 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:10:19,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785667739] [2024-11-08 17:10:19,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785667739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:10:19,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:10:19,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 17:10:19,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751775415] [2024-11-08 17:10:19,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:10:19,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 17:10:19,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:10:19,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 17:10:19,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:10:19,821 INFO L87 Difference]: Start difference. First operand has 118 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 95 states have internal predecessors, (130), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:10:19,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:10:19,856 INFO L93 Difference]: Finished difference Result 229 states and 359 transitions. [2024-11-08 17:10:19,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 17:10:19,860 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-11-08 17:10:19,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:10:19,869 INFO L225 Difference]: With dead ends: 229 [2024-11-08 17:10:19,869 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 17:10:19,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 17:10:19,878 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:10:19,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:10:19,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 17:10:19,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-08 17:10:19,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 91 states have internal predecessors, (123), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:10:19,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2024-11-08 17:10:19,935 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 159 [2024-11-08 17:10:19,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:10:19,935 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2024-11-08 17:10:19,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:10:19,936 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2024-11-08 17:10:19,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:10:19,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:19,945 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:10:19,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0 [2024-11-08 17:10:20,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:20,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:10:20,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:20,150 INFO L85 PathProgramCache]: Analyzing trace with hash -617465663, now seen corresponding path program 1 times [2024-11-08 17:10:20,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:10:20,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11556520] [2024-11-08 17:10:20,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:20,152 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 [2024-11-08 17:10:20,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:10:20,155 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:10:20,156 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:20,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:20,660 INFO L255 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 17:10:20,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:10:20,764 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 432 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2024-11-08 17:10:20,764 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:10:20,765 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:10:20,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11556520] [2024-11-08 17:10:20,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11556520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:10:20,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:10:20,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:10:20,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395245596] [2024-11-08 17:10:20,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:10:20,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:10:20,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:10:20,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:10:20,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:10:20,772 INFO L87 Difference]: Start difference. First operand 114 states and 165 transitions. Second operand has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:10:20,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:10:20,864 INFO L93 Difference]: Finished difference Result 227 states and 330 transitions. [2024-11-08 17:10:20,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:10:20,866 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 159 [2024-11-08 17:10:20,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:10:20,868 INFO L225 Difference]: With dead ends: 227 [2024-11-08 17:10:20,868 INFO L226 Difference]: Without dead ends: 116 [2024-11-08 17:10:20,869 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:10:20,871 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 0 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 478 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:10:20,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:10:20,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-08 17:10:20,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-08 17:10:20,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 93 states have (on average 1.3440860215053763) internal successors, (125), 93 states have internal predecessors, (125), 21 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2024-11-08 17:10:20,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2024-11-08 17:10:20,905 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 159 [2024-11-08 17:10:20,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:10:20,907 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2024-11-08 17:10:20,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:10:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2024-11-08 17:10:20,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-08 17:10:20,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:20,914 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:10:20,928 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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)] Forceful destruction successful, exit code 0 [2024-11-08 17:10:21,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:21,115 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:10:21,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:21,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2076430527, now seen corresponding path program 1 times [2024-11-08 17:10:21,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:10:21,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186238590] [2024-11-08 17:10:21,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:21,119 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 [2024-11-08 17:10:21,119 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:10:21,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:10:21,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:21,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 17:10:21,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:10:21,775 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 19 treesize of output 15 [2024-11-08 17:10:21,949 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:10:21,950 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:10:21,950 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:10:21,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186238590] [2024-11-08 17:10:21,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186238590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:10:21,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:10:21,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:10:21,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367361222] [2024-11-08 17:10:21,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:10:21,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:10:21,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:10:21,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:10:21,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:10:21,955 INFO L87 Difference]: Start difference. First operand 116 states and 167 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:10:25,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:10:26,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:10:26,194 INFO L93 Difference]: Finished difference Result 329 states and 475 transitions. [2024-11-08 17:10:26,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:10:26,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 159 [2024-11-08 17:10:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:10:26,199 INFO L225 Difference]: With dead ends: 329 [2024-11-08 17:10:26,200 INFO L226 Difference]: Without dead ends: 216 [2024-11-08 17:10:26,201 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 17:10:26,202 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 130 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:10:26,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 838 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-11-08 17:10:26,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-08 17:10:26,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2024-11-08 17:10:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 173 states have (on average 1.3526011560693643) internal successors, (234), 174 states have internal predecessors, (234), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 17:10:26,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 308 transitions. [2024-11-08 17:10:26,233 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 308 transitions. Word has length 159 [2024-11-08 17:10:26,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:10:26,234 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 308 transitions. [2024-11-08 17:10:26,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:10:26,235 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 308 transitions. [2024-11-08 17:10:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:10:26,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:26,239 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:10:26,253 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:26,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:26,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:10:26,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:26,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1712493998, now seen corresponding path program 1 times [2024-11-08 17:10:26,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:10:26,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [156875701] [2024-11-08 17:10:26,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:26,448 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 [2024-11-08 17:10:26,448 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:10:26,451 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:10:26,453 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:26,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:26,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 17:10:26,997 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:10:27,070 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:10:27,070 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:10:27,071 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:10:27,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [156875701] [2024-11-08 17:10:27,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [156875701] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:10:27,072 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:10:27,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:10:27,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917422935] [2024-11-08 17:10:27,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:10:27,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:10:27,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:10:27,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:10:27,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:10:27,075 INFO L87 Difference]: Start difference. First operand 213 states and 308 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:10:27,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:10:27,188 INFO L93 Difference]: Finished difference Result 433 states and 627 transitions. [2024-11-08 17:10:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:10:27,189 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 160 [2024-11-08 17:10:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:10:27,193 INFO L225 Difference]: With dead ends: 433 [2024-11-08 17:10:27,193 INFO L226 Difference]: Without dead ends: 223 [2024-11-08 17:10:27,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-08 17:10:27,198 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 1 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:10:27,198 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 627 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:10:27,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-08 17:10:27,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2024-11-08 17:10:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 181 states have (on average 1.3370165745856353) internal successors, (242), 182 states have internal predecessors, (242), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 17:10:27,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 316 transitions. [2024-11-08 17:10:27,241 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 316 transitions. Word has length 160 [2024-11-08 17:10:27,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:10:27,246 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 316 transitions. [2024-11-08 17:10:27,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:10:27,246 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 316 transitions. [2024-11-08 17:10:27,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-08 17:10:27,252 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:27,253 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:10:27,264 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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)] Ended with exit code 0 [2024-11-08 17:10:27,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:27,455 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:10:27,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:27,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1710646956, now seen corresponding path program 1 times [2024-11-08 17:10:27,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:10:27,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1613164700] [2024-11-08 17:10:27,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:27,462 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 [2024-11-08 17:10:27,462 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:10:27,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:10:27,465 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:28,006 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-08 17:10:28,013 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:10:28,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:10:28,529 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 155 treesize of output 65 [2024-11-08 17:10:28,620 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2024-11-08 17:10:28,621 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:10:28,621 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:10:28,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1613164700] [2024-11-08 17:10:28,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1613164700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:10:28,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:10:28,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 17:10:28,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6476714] [2024-11-08 17:10:28,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:10:28,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:10:28,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:10:28,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:10:28,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:10:28,627 INFO L87 Difference]: Start difference. First operand 221 states and 316 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:10:31,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-08 17:10:33,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:10:33,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:10:33,862 INFO L93 Difference]: Finished difference Result 441 states and 631 transitions. [2024-11-08 17:10:33,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:10:33,879 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 160 [2024-11-08 17:10:33,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:10:33,882 INFO L225 Difference]: With dead ends: 441 [2024-11-08 17:10:33,882 INFO L226 Difference]: Without dead ends: 223 [2024-11-08 17:10:33,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:10:33,884 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 133 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 532 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:10:33,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 532 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-08 17:10:33,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-08 17:10:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2024-11-08 17:10:33,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 181 states have (on average 1.3259668508287292) internal successors, (240), 182 states have internal predecessors, (240), 37 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (37), 36 states have call predecessors, (37), 37 states have call successors, (37) [2024-11-08 17:10:33,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 314 transitions. [2024-11-08 17:10:33,921 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 314 transitions. Word has length 160 [2024-11-08 17:10:33,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:10:33,931 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 314 transitions. [2024-11-08 17:10:33,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 5 states have internal predecessors, (61), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2024-11-08 17:10:33,932 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 314 transitions. [2024-11-08 17:10:33,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-08 17:10:33,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:10:33,936 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:10:33,948 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:34,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:34,138 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:10:34,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:10:34,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1848858310, now seen corresponding path program 1 times [2024-11-08 17:10:34,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:10:34,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681345488] [2024-11-08 17:10:34,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:10:34,140 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 [2024-11-08 17:10:34,142 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:10:34,144 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:10:34,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:10:34,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:10:34,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-08 17:10:34,962 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:10:42,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:10:42,336 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 144 treesize of output 54 [2024-11-08 17:10:42,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2024-11-08 17:10:43,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:10:43,280 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 149 treesize of output 59 [2024-11-08 17:10:51,562 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 428 proven. 36 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-08 17:10:51,563 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:13:34,272 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:13:34,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681345488] [2024-11-08 17:13:34,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681345488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:13:34,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1649389923] [2024-11-08 17:13:34,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:13:34,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:13:34,274 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:13:34,277 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:13:34,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-08 17:13:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:13:34,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-08 17:13:34,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:13:42,467 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 25 treesize of output 24 [2024-11-08 17:13:53,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:13:53,820 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 35 treesize of output 37 [2024-11-08 17:14:04,622 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:14:04,623 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 50 treesize of output 40 [2024-11-08 17:14:06,929 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:14:06,930 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 45 treesize of output 50 [2024-11-08 17:14:38,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:14:38,948 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 51 treesize of output 21 [2024-11-08 17:14:47,832 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 392 proven. 0 refuted. 0 times theorem prover too weak. 448 trivial. 0 not checked. [2024-11-08 17:14:47,832 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:14:47,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1649389923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:14:47,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:14:47,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [16] total 21 [2024-11-08 17:14:47,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575668878] [2024-11-08 17:14:47,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:14:47,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 17:14:47,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:14:47,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 17:14:47,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=554, Unknown=13, NotChecked=0, Total=650 [2024-11-08 17:14:47,839 INFO L87 Difference]: Start difference. First operand 221 states and 314 transitions. Second operand has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 17:14:57,282 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:14:59,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-08 17:14:59,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:14:59,694 INFO L93 Difference]: Finished difference Result 657 states and 936 transitions. [2024-11-08 17:14:59,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:14:59,695 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 162 [2024-11-08 17:14:59,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:14:59,700 INFO L225 Difference]: With dead ends: 657 [2024-11-08 17:14:59,700 INFO L226 Difference]: Without dead ends: 439 [2024-11-08 17:14:59,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 175.6s TimeCoverageRelationStatistics Valid=90, Invalid=599, Unknown=13, NotChecked=0, Total=702 [2024-11-08 17:14:59,703 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 162 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:14:59,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 418 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2024-11-08 17:14:59,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-11-08 17:14:59,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 425. [2024-11-08 17:14:59,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 346 states have (on average 1.3179190751445087) internal successors, (456), 348 states have internal predecessors, (456), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 72 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-08 17:14:59,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 604 transitions. [2024-11-08 17:14:59,760 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 604 transitions. Word has length 162 [2024-11-08 17:14:59,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:14:59,761 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 604 transitions. [2024-11-08 17:14:59,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.428571428571429) internal successors, (66), 6 states have internal predecessors, (66), 3 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2024-11-08 17:14:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 604 transitions. [2024-11-08 17:14:59,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-08 17:14:59,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:14:59,774 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:14:59,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-08 17:14:59,983 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:15:00,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:15:00,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:15:00,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:15:00,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1614211690, now seen corresponding path program 1 times [2024-11-08 17:15:00,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:15:00,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634280321] [2024-11-08 17:15:00,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:15:00,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 [2024-11-08 17:15:00,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:15:00,178 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:15:00,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:15:00,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:15:01,010 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 17:15:01,018 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:15:41,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2024-11-08 17:15:41,850 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:15:41,851 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 144 treesize of output 54 [2024-11-08 17:15:45,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:15:45,893 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 149 treesize of output 59 [2024-11-08 17:16:02,627 WARN L286 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:16:18,346 WARN L286 SmtUtils]: Spent 6.24s on a formula simplification. DAG size of input: 10 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:16:24,993 WARN L286 SmtUtils]: Spent 6.65s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:16:30,868 WARN L286 SmtUtils]: Spent 5.87s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:16:34,881 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_25 (_ BitVec 32)) (v_arrayElimCell_24 (_ BitVec 32)) (v_arrayElimCell_23 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_24) ((_ extract 30 23) v_arrayElimCell_24) ((_ extract 22 0) v_arrayElimCell_24))) (.cse2 (let ((.cse4 (concat v_arrayElimCell_23 v_arrayElimCell_22))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_25) ((_ extract 30 23) v_arrayElimCell_25) ((_ extract 22 0) v_arrayElimCell_25))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (and (= .cse0 .cse1) (fp.geq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven .cse3)) (not (fp.geq (fp.sub roundNearestTiesToEven .cse2 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse0))) ((_ to_fp 11 53) roundNearestTiesToEven .cse0))) (fp.leq .cse2 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (fp.leq .cse1 (fp.neg .cse3))))) is different from false [2024-11-08 17:16:47,603 WARN L286 SmtUtils]: Spent 6.60s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:07,213 WARN L286 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:17,598 WARN L286 SmtUtils]: Spent 6.37s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:37,477 WARN L286 SmtUtils]: Spent 5.69s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:17:48,583 WARN L286 SmtUtils]: Spent 7.09s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:18:06,028 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:18:11,411 WARN L286 SmtUtils]: Spent 5.38s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:18:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 428 proven. 36 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-08 17:18:19,438 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:21:39,116 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-08 17:21:39,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634280321] [2024-11-08 17:21:39,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634280321] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 17:21:39,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042191395] [2024-11-08 17:21:39,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:21:39,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 17:21:39,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 17:21:39,120 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 17:21:39,121 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-08 17:21:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:21:39,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-08 17:21:39,454 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:21:39,552 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 17 treesize of output 13 [2024-11-08 17:21:39,613 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 13 treesize of output 9 [2024-11-08 17:21:53,967 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 24 treesize of output 12 [2024-11-08 17:22:03,275 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-08 17:22:03,275 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:22:03,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042191395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:22:03,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 17:22:03,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [17] total 21 [2024-11-08 17:22:03,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580037923] [2024-11-08 17:22:03,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:22:03,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 17:22:03,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-08 17:22:03,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 17:22:03,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=462, Unknown=19, NotChecked=44, Total=600 [2024-11-08 17:22:03,279 INFO L87 Difference]: Start difference. First operand 425 states and 604 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:22:07,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:17,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-08 17:22:18,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:22:18,261 INFO L93 Difference]: Finished difference Result 1074 states and 1529 transitions. [2024-11-08 17:22:18,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 17:22:18,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) Word has length 163 [2024-11-08 17:22:18,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:22:18,282 INFO L225 Difference]: With dead ends: 1074 [2024-11-08 17:22:18,282 INFO L226 Difference]: Without dead ends: 652 [2024-11-08 17:22:18,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 204.7s TimeCoverageRelationStatistics Valid=80, Invalid=505, Unknown=19, NotChecked=46, Total=650 [2024-11-08 17:22:18,285 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 155 mSDsluCounter, 508 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-08 17:22:18,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 720 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2024-11-08 17:22:18,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2024-11-08 17:22:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 649. [2024-11-08 17:22:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 526 states have (on average 1.3155893536121672) internal successors, (692), 528 states have internal predecessors, (692), 116 states have call successors, (116), 6 states have call predecessors, (116), 6 states have return successors, (116), 114 states have call predecessors, (116), 116 states have call successors, (116) [2024-11-08 17:22:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 924 transitions. [2024-11-08 17:22:18,359 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 924 transitions. Word has length 163 [2024-11-08 17:22:18,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:22:18,359 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 924 transitions. [2024-11-08 17:22:18,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (21), 1 states have call predecessors, (21), 1 states have return successors, (21), 1 states have call predecessors, (21), 1 states have call successors, (21) [2024-11-08 17:22:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 924 transitions. [2024-11-08 17:22:18,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-08 17:22:18,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:22:18,363 INFO L215 NwaCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:22:18,397 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-08 17:22:18,571 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:22:18,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:22:18,764 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:22:18,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:22:18,765 INFO L85 PathProgramCache]: Analyzing trace with hash 904406416, now seen corresponding path program 1 times [2024-11-08 17:22:18,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-08 17:22:18,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1740639331] [2024-11-08 17:22:18,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:22:18,766 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 [2024-11-08 17:22:18,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/mathsat [2024-11-08 17:22:18,767 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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) [2024-11-08 17:22:18,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50c3b4b5-8ee3-4d97-ae40-6292ab481afe/bin/uautomizer-verify-jihMAELWvX/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 [2024-11-08 17:22:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:22:19,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 17:22:19,603 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:23:01,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 61 [2024-11-08 17:23:01,504 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:23:01,504 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 144 treesize of output 54 [2024-11-08 17:23:05,038 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 17:23:05,039 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 149 treesize of output 59 [2024-11-08 17:23:26,688 WARN L286 SmtUtils]: Spent 6.40s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:23:34,742 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:23:39,937 WARN L286 SmtUtils]: Spent 5.19s on a formula simplification. DAG size of input: 12 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:23:53,303 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_32 (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 32)) (v_arrayElimCell_30 (_ BitVec 32)) (v_arrayElimCell_29 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_31) ((_ extract 30 23) v_arrayElimCell_31) ((_ extract 22 0) v_arrayElimCell_31))) (.cse0 (let ((.cse4 (concat v_arrayElimCell_30 v_arrayElimCell_29))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_32) ((_ extract 30 23) v_arrayElimCell_32) ((_ extract 22 0) v_arrayElimCell_32)))) (and (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (= .cse1 .cse2) (fp.leq .cse2 (fp.neg .cse3)) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven .cse3)) (fp.geq .cse2 (fp.neg ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854765600.0)))))) is different from false [2024-11-08 17:24:05,804 WARN L286 SmtUtils]: Spent 5.14s on a formula simplification that was a NOOP. DAG size: 19 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2024-11-08 17:24:11,991 WARN L286 SmtUtils]: Spent 6.19s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)