./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 6497de01 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC --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.3.0-dev-6497de0 [2024-11-24 01:28:32,466 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:28:32,568 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-24 01:28:32,577 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:28:32,578 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:28:32,617 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:28:32,618 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:28:32,618 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:28:32,618 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:28:32,618 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:28:32,618 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:28:32,619 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:28:32,619 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:28:32,619 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:28:32,619 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:28:32,619 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:28:32,619 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:28:32,619 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:28:32,619 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-24 01:28:32,620 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:28:32,620 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:28:32,620 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:28:32,620 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:28:32,620 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:28:32,620 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:28:32,620 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:28:32,620 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:28:32,620 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:28:32,620 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:28:32,620 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:28:32,621 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:28:32,621 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:28:32,621 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:28:32,624 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:28:32,624 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:28:32,624 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:28:32,624 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:28:32,624 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:28:32,625 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:28:32,625 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:28:32,625 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:28:32,625 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:28:32,625 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-24 01:28:32,625 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-24 01:28:32,626 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:28:32,626 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:28:32,626 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:28:32,626 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:28:32,626 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC 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-24 01:28:32,935 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:28:32,946 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:28:32,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:28:32,951 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:28:32,951 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:28:32,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-11-24 01:28:36,286 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/data/3a5e3b990/2ff42cd79bdb4f4db1e957b5af5318e6/FLAG3d27a2433 [2024-11-24 01:28:36,583 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:28:36,587 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-11-24 01:28:36,601 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/data/3a5e3b990/2ff42cd79bdb4f4db1e957b5af5318e6/FLAG3d27a2433 [2024-11-24 01:28:36,873 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/data/3a5e3b990/2ff42cd79bdb4f4db1e957b5af5318e6 [2024-11-24 01:28:36,877 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:28:36,879 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:28:36,882 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:28:36,882 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:28:36,887 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:28:36,888 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:28:36" (1/1) ... [2024-11-24 01:28:36,892 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b3edbce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:36, skipping insertion in model container [2024-11-24 01:28:36,892 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:28:36" (1/1) ... [2024-11-24 01:28:36,920 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:28:37,127 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_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i[916,929] [2024-11-24 01:28:37,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:28:37,263 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:28:37,275 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_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i[916,929] [2024-11-24 01:28:37,325 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:28:37,348 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:28:37,348 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37 WrapperNode [2024-11-24 01:28:37,349 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:28:37,350 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:28:37,350 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:28:37,350 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:28:37,358 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,372 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,415 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2024-11-24 01:28:37,416 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:28:37,416 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:28:37,417 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:28:37,417 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:28:37,427 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,428 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,454 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-24 01:28:37,454 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,455 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,487 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,489 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,501 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,507 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,520 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:28:37,521 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:28:37,521 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:28:37,521 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:28:37,522 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (1/1) ... [2024-11-24 01:28:37,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:28:37,561 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:28:37,579 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:28:37,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:28:37,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:28:37,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-11-24 01:28:37,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-11-24 01:28:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-11-24 01:28:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-11-24 01:28:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-11-24 01:28:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-11-24 01:28:37,620 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-11-24 01:28:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-24 01:28:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-24 01:28:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-24 01:28:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-24 01:28:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-24 01:28:37,621 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-24 01:28:37,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-24 01:28:37,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-11-24 01:28:37,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-11-24 01:28:37,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-11-24 01:28:37,622 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-11-24 01:28:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-11-24 01:28:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-11-24 01:28:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-11-24 01:28:37,624 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-24 01:28:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-24 01:28:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-24 01:28:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-24 01:28:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-24 01:28:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-24 01:28:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-24 01:28:37,625 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-11-24 01:28:37,626 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-11-24 01:28:37,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-11-24 01:28:37,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-11-24 01:28:37,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-11-24 01:28:37,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-11-24 01:28:37,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-11-24 01:28:37,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:28:37,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:28:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-24 01:28:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-24 01:28:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-24 01:28:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-24 01:28:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-24 01:28:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-24 01:28:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-24 01:28:37,630 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:28:37,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:28:37,877 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:28:37,878 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:28:38,750 INFO L? ?]: Removed 120 outVars from TransFormulas that were not future-live. [2024-11-24 01:28:38,750 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:28:38,766 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:28:38,766 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:28:38,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:28:38 BoogieIcfgContainer [2024-11-24 01:28:38,767 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:28:38,770 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:28:38,770 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:28:38,776 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:28:38,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:28:36" (1/3) ... [2024-11-24 01:28:38,777 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2036f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:28:38, skipping insertion in model container [2024-11-24 01:28:38,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:28:37" (2/3) ... [2024-11-24 01:28:38,778 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b2036f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:28:38, skipping insertion in model container [2024-11-24 01:28:38,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:28:38" (3/3) ... [2024-11-24 01:28:38,780 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-44.i [2024-11-24 01:28:38,800 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:28:38,802 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-44.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 01:28:38,889 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:28:38,909 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;@42049931, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:28:38,910 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:28:38,916 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-24 01:28:38,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-24 01:28:38,938 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:38,938 INFO L218 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-24 01:28:38,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:38,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:38,948 INFO L85 PathProgramCache]: Analyzing trace with hash -882731756, now seen corresponding path program 1 times [2024-11-24 01:28:38,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:38,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83495529] [2024-11-24 01:28:38,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:38,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:39,555 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-24 01:28:39,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:39,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83495529] [2024-11-24 01:28:39,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83495529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:28:39,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527053441] [2024-11-24 01:28:39,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:39,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:28:39,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:28:39,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:28:39,568 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-24 01:28:39,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:39,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 529 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:28:40,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:28:40,052 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 800 trivial. 0 not checked. [2024-11-24 01:28:40,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:28:40,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527053441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:40,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:28:40,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-24 01:28:40,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140778659] [2024-11-24 01:28:40,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:40,064 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:28:40,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:40,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:28:40,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:28:40,094 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 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (21), 2 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-24 01:28:40,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:40,183 INFO L93 Difference]: Finished difference Result 229 states and 359 transitions. [2024-11-24 01:28:40,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:28:40,185 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (21), 2 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-24 01:28:40,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:40,193 INFO L225 Difference]: With dead ends: 229 [2024-11-24 01:28:40,194 INFO L226 Difference]: Without dead ends: 114 [2024-11-24 01:28:40,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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-24 01:28:40,200 INFO L435 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-24 01:28:40,201 INFO L436 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-24 01:28:40,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-24 01:28:40,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-24 01:28:40,255 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-24 01:28:40,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2024-11-24 01:28:40,266 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 159 [2024-11-24 01:28:40,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:40,267 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2024-11-24 01:28:40,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (21), 2 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-24 01:28:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2024-11-24 01:28:40,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-24 01:28:40,274 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:40,274 INFO L218 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-24 01:28:40,287 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-24 01:28:40,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:28:40,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:40,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:40,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1168682478, now seen corresponding path program 1 times [2024-11-24 01:28:40,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:40,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664764851] [2024-11-24 01:28:40,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:40,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:40,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:41,181 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-24 01:28:41,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:41,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664764851] [2024-11-24 01:28:41,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664764851] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:41,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:41,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:28:41,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466057753] [2024-11-24 01:28:41,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:41,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:28:41,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:41,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:28:41,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:28:41,191 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), 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-24 01:28:41,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:41,274 INFO L93 Difference]: Finished difference Result 228 states and 331 transitions. [2024-11-24 01:28:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:28:41,274 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-24 01:28:41,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:41,276 INFO L225 Difference]: With dead ends: 228 [2024-11-24 01:28:41,276 INFO L226 Difference]: Without dead ends: 117 [2024-11-24 01:28:41,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-24 01:28:41,278 INFO L435 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-24 01:28:41,281 INFO L436 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-24 01:28:41,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2024-11-24 01:28:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2024-11-24 01:28:41,300 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-24 01:28:41,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 167 transitions. [2024-11-24 01:28:41,305 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 167 transitions. Word has length 159 [2024-11-24 01:28:41,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:41,311 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 167 transitions. [2024-11-24 01:28:41,311 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-24 01:28:41,311 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 167 transitions. [2024-11-24 01:28:41,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-24 01:28:41,314 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:41,314 INFO L218 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-24 01:28:41,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-24 01:28:41,314 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:41,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:41,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1170529520, now seen corresponding path program 1 times [2024-11-24 01:28:41,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:41,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143721668] [2024-11-24 01:28:41,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:41,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:42,252 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-24 01:28:42,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:42,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143721668] [2024-11-24 01:28:42,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143721668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:42,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:42,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:28:42,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578412946] [2024-11-24 01:28:42,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:42,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:28:42,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:42,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:28:42,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:28:42,257 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-24 01:28:42,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:42,589 INFO L93 Difference]: Finished difference Result 329 states and 475 transitions. [2024-11-24 01:28:42,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:28:42,590 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-24 01:28:42,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:42,597 INFO L225 Difference]: With dead ends: 329 [2024-11-24 01:28:42,597 INFO L226 Difference]: Without dead ends: 216 [2024-11-24 01:28:42,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-24 01:28:42,599 INFO L435 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-24 01:28:42,600 INFO L436 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-24 01:28:42,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2024-11-24 01:28:42,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 213. [2024-11-24 01:28:42,641 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-24 01:28:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 308 transitions. [2024-11-24 01:28:42,645 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 308 transitions. Word has length 159 [2024-11-24 01:28:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:42,648 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 308 transitions. [2024-11-24 01:28:42,648 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-24 01:28:42,649 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 308 transitions. [2024-11-24 01:28:42,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-24 01:28:42,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:42,655 INFO L218 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-24 01:28:42,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-24 01:28:42,659 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:42,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:42,660 INFO L85 PathProgramCache]: Analyzing trace with hash 213934598, now seen corresponding path program 1 times [2024-11-24 01:28:42,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:42,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867057155] [2024-11-24 01:28:42,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:42,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:43,584 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-24 01:28:43,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:43,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867057155] [2024-11-24 01:28:43,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867057155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:43,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:43,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:28:43,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500497289] [2024-11-24 01:28:43,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:43,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:28:43,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:43,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:28:43,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:28:43,590 INFO L87 Difference]: Start difference. First operand 213 states and 308 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-24 01:28:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:44,058 INFO L93 Difference]: Finished difference Result 461 states and 665 transitions. [2024-11-24 01:28:44,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:28:44,059 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-24 01:28:44,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:44,066 INFO L225 Difference]: With dead ends: 461 [2024-11-24 01:28:44,066 INFO L226 Difference]: Without dead ends: 251 [2024-11-24 01:28:44,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-24 01:28:44,071 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 114 mSDsluCounter, 824 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1095 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:44,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1095 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-24 01:28:44,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2024-11-24 01:28:44,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2024-11-24 01:28:44,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 197 states have (on average 1.3350253807106598) internal successors, (263), 199 states have internal predecessors, (263), 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-24 01:28:44,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 357 transitions. [2024-11-24 01:28:44,122 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 357 transitions. Word has length 160 [2024-11-24 01:28:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:44,127 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 357 transitions. [2024-11-24 01:28:44,127 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-24 01:28:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 357 transitions. [2024-11-24 01:28:44,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-24 01:28:44,130 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:44,130 INFO L218 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-24 01:28:44,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-24 01:28:44,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:44,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:44,134 INFO L85 PathProgramCache]: Analyzing trace with hash -930079813, now seen corresponding path program 1 times [2024-11-24 01:28:44,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:44,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180829830] [2024-11-24 01:28:44,135 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:44,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:44,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:44,609 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2024-11-24 01:28:44,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:44,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180829830] [2024-11-24 01:28:44,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180829830] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:28:44,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387548882] [2024-11-24 01:28:44,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:44,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:28:44,610 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:28:44,615 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:28:44,617 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-24 01:28:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:44,948 INFO L256 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:28:44,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:28:45,024 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-24 01:28:45,025 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:28:45,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387548882] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:45,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:28:45,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2024-11-24 01:28:45,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125133042] [2024-11-24 01:28:45,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:45,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:28:45,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:45,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:28:45,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:28:45,027 INFO L87 Difference]: Start difference. First operand 248 states and 357 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-24 01:28:45,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:45,100 INFO L93 Difference]: Finished difference Result 468 states and 672 transitions. [2024-11-24 01:28:45,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:28:45,101 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-24 01:28:45,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:45,104 INFO L225 Difference]: With dead ends: 468 [2024-11-24 01:28:45,104 INFO L226 Difference]: Without dead ends: 254 [2024-11-24 01:28:45,105 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:28:45,109 INFO L435 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-24 01:28:45,109 INFO L436 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-24 01:28:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-24 01:28:45,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-24 01:28:45,143 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-24 01:28:45,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 363 transitions. [2024-11-24 01:28:45,146 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 363 transitions. Word has length 161 [2024-11-24 01:28:45,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:45,147 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 363 transitions. [2024-11-24 01:28:45,148 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-24 01:28:45,148 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 363 transitions. [2024-11-24 01:28:45,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-24 01:28:45,150 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:45,150 INFO L218 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-24 01:28:45,161 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-24 01:28:45,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:28:45,354 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:45,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:45,355 INFO L85 PathProgramCache]: Analyzing trace with hash 999770824, now seen corresponding path program 1 times [2024-11-24 01:28:45,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:45,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890554096] [2024-11-24 01:28:45,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:45,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:45,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:45,958 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-24 01:28:45,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:45,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890554096] [2024-11-24 01:28:45,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890554096] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:45,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:45,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:28:45,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260928524] [2024-11-24 01:28:45,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:45,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:28:45,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:45,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:28:45,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:28:45,963 INFO L87 Difference]: Start difference. First operand 254 states and 363 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-24 01:28:46,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:46,296 INFO L93 Difference]: Finished difference Result 479 states and 675 transitions. [2024-11-24 01:28:46,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:28:46,297 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-24 01:28:46,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:46,303 INFO L225 Difference]: With dead ends: 479 [2024-11-24 01:28:46,303 INFO L226 Difference]: Without dead ends: 259 [2024-11-24 01:28:46,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-24 01:28:46,305 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 108 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:46,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 650 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 01:28:46,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-24 01:28:46,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 221. [2024-11-24 01:28:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 179 states have (on average 1.312849162011173) internal successors, (235), 180 states have internal predecessors, (235), 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-24 01:28:46,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 309 transitions. [2024-11-24 01:28:46,342 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 309 transitions. Word has length 163 [2024-11-24 01:28:46,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:46,343 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 309 transitions. [2024-11-24 01:28:46,344 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-24 01:28:46,344 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 309 transitions. [2024-11-24 01:28:46,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-24 01:28:46,347 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:46,347 INFO L218 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-24 01:28:46,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-24 01:28:46,348 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:46,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:46,349 INFO L85 PathProgramCache]: Analyzing trace with hash 150942112, now seen corresponding path program 1 times [2024-11-24 01:28:46,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:46,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67544732] [2024-11-24 01:28:46,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:46,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:46,634 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-24 01:28:46,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:46,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67544732] [2024-11-24 01:28:46,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67544732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:46,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:46,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-24 01:28:46,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208650504] [2024-11-24 01:28:46,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:46,636 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-24 01:28:46,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:46,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-24 01:28:46,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-24 01:28:46,639 INFO L87 Difference]: Start difference. First operand 221 states and 309 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-24 01:28:46,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:46,683 INFO L93 Difference]: Finished difference Result 439 states and 615 transitions. [2024-11-24 01:28:46,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-24 01:28:46,684 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-24 01:28:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:46,687 INFO L225 Difference]: With dead ends: 439 [2024-11-24 01:28:46,687 INFO L226 Difference]: Without dead ends: 221 [2024-11-24 01:28:46,689 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-24 01:28:46,691 INFO L435 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-24 01:28:46,692 INFO L436 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-24 01:28:46,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-24 01:28:46,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2024-11-24 01:28:46,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 179 states have (on average 1.3016759776536313) internal successors, (233), 180 states have internal predecessors, (233), 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-24 01:28:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 307 transitions. [2024-11-24 01:28:46,734 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 307 transitions. Word has length 163 [2024-11-24 01:28:46,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:46,734 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 307 transitions. [2024-11-24 01:28:46,735 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-24 01:28:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 307 transitions. [2024-11-24 01:28:46,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-24 01:28:46,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:46,740 INFO L218 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-24 01:28:46,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-24 01:28:46,741 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:46,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:46,743 INFO L85 PathProgramCache]: Analyzing trace with hash 1618891998, now seen corresponding path program 1 times [2024-11-24 01:28:46,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:46,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681465895] [2024-11-24 01:28:46,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:46,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:46,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:47,278 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-24 01:28:47,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:47,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681465895] [2024-11-24 01:28:47,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681465895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:47,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:47,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:28:47,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594663876] [2024-11-24 01:28:47,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:47,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:28:47,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:47,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:28:47,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:28:47,281 INFO L87 Difference]: Start difference. First operand 221 states and 307 transitions. Second operand has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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-24 01:28:47,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:47,683 INFO L93 Difference]: Finished difference Result 638 states and 886 transitions. [2024-11-24 01:28:47,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:28:47,684 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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 164 [2024-11-24 01:28:47,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:47,688 INFO L225 Difference]: With dead ends: 638 [2024-11-24 01:28:47,688 INFO L226 Difference]: Without dead ends: 420 [2024-11-24 01:28:47,690 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-24 01:28:47,690 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 123 mSDsluCounter, 673 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:47,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 880 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 01:28:47,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-24 01:28:47,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 416. [2024-11-24 01:28:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 342 states have (on average 1.3099415204678362) internal successors, (448), 345 states have internal predecessors, (448), 65 states have call successors, (65), 8 states have call predecessors, (65), 8 states have return successors, (65), 62 states have call predecessors, (65), 65 states have call successors, (65) [2024-11-24 01:28:47,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 578 transitions. [2024-11-24 01:28:47,737 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 578 transitions. Word has length 164 [2024-11-24 01:28:47,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:47,737 INFO L471 AbstractCegarLoop]: Abstraction has 416 states and 578 transitions. [2024-11-24 01:28:47,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.4) internal successors, (62), 6 states have internal predecessors, (62), 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-24 01:28:47,738 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 578 transitions. [2024-11-24 01:28:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-24 01:28:47,740 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:47,741 INFO L218 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-24 01:28:47,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-24 01:28:47,741 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:47,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:47,742 INFO L85 PathProgramCache]: Analyzing trace with hash 607774748, now seen corresponding path program 1 times [2024-11-24 01:28:47,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:47,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909336078] [2024-11-24 01:28:47,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:47,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:47,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:48,697 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-24 01:28:48,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:48,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909336078] [2024-11-24 01:28:48,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909336078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:48,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:48,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:28:48,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983759746] [2024-11-24 01:28:48,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:48,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:28:48,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:48,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:28:48,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:28:48,701 INFO L87 Difference]: Start difference. First operand 416 states and 578 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-24 01:28:48,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:48,975 INFO L93 Difference]: Finished difference Result 1242 states and 1728 transitions. [2024-11-24 01:28:48,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:28:48,976 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-24 01:28:48,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:48,983 INFO L225 Difference]: With dead ends: 1242 [2024-11-24 01:28:48,983 INFO L226 Difference]: Without dead ends: 829 [2024-11-24 01:28:48,985 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 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-24 01:28:48,986 INFO L435 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.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:48,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 421 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-24 01:28:48,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2024-11-24 01:28:49,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 803. [2024-11-24 01:28:49,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 656 states have (on average 1.298780487804878) internal successors, (852), 662 states have internal predecessors, (852), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 124 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-24 01:28:49,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1112 transitions. [2024-11-24 01:28:49,127 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1112 transitions. Word has length 164 [2024-11-24 01:28:49,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:49,128 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1112 transitions. [2024-11-24 01:28:49,128 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-24 01:28:49,129 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1112 transitions. [2024-11-24 01:28:49,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-24 01:28:49,132 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:49,132 INFO L218 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-24 01:28:49,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-24 01:28:49,133 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:49,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1838657055, now seen corresponding path program 1 times [2024-11-24 01:28:49,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:49,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442762806] [2024-11-24 01:28:49,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:49,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:49,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:49,375 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-24 01:28:49,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:49,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442762806] [2024-11-24 01:28:49,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442762806] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:49,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:49,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:28:49,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774248552] [2024-11-24 01:28:49,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:49,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:28:49,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:49,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:28:49,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:28:49,378 INFO L87 Difference]: Start difference. First operand 803 states and 1112 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-24 01:28:49,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:49,511 INFO L93 Difference]: Finished difference Result 1607 states and 2225 transitions. [2024-11-24 01:28:49,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:28:49,512 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-24 01:28:49,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:49,519 INFO L225 Difference]: With dead ends: 1607 [2024-11-24 01:28:49,520 INFO L226 Difference]: Without dead ends: 807 [2024-11-24 01:28:49,522 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-24 01:28:49,523 INFO L435 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-24 01:28:49,524 INFO L436 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-24 01:28:49,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2024-11-24 01:28:49,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 803. [2024-11-24 01:28:49,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 656 states have (on average 1.2865853658536586) internal successors, (844), 662 states have internal predecessors, (844), 130 states have call successors, (130), 16 states have call predecessors, (130), 16 states have return successors, (130), 124 states have call predecessors, (130), 130 states have call successors, (130) [2024-11-24 01:28:49,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1104 transitions. [2024-11-24 01:28:49,620 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1104 transitions. Word has length 165 [2024-11-24 01:28:49,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:49,621 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1104 transitions. [2024-11-24 01:28:49,622 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-24 01:28:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1104 transitions. [2024-11-24 01:28:49,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-24 01:28:49,627 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:49,628 INFO L218 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-24 01:28:49,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-24 01:28:49,629 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:49,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:49,630 INFO L85 PathProgramCache]: Analyzing trace with hash 31766162, now seen corresponding path program 1 times [2024-11-24 01:28:49,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:49,630 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251943215] [2024-11-24 01:28:49,630 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:49,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:50,523 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-24 01:28:50,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:50,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251943215] [2024-11-24 01:28:50,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251943215] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:50,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:50,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 01:28:50,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621314736] [2024-11-24 01:28:50,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:50,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:28:50,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:50,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:28:50,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:28:50,527 INFO L87 Difference]: Start difference. First operand 803 states and 1104 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-24 01:28:50,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:50,997 INFO L93 Difference]: Finished difference Result 2017 states and 2772 transitions. [2024-11-24 01:28:50,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:28:50,998 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-24 01:28:50,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:51,008 INFO L225 Difference]: With dead ends: 2017 [2024-11-24 01:28:51,008 INFO L226 Difference]: Without dead ends: 1217 [2024-11-24 01:28:51,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-24 01:28:51,011 INFO L435 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-24 01:28:51,012 INFO L436 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-24 01:28:51,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-24 01:28:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1211. [2024-11-24 01:28:51,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 992 states have (on average 1.280241935483871) internal successors, (1270), 1002 states have internal predecessors, (1270), 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-24 01:28:51,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1658 transitions. [2024-11-24 01:28:51,142 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1658 transitions. Word has length 166 [2024-11-24 01:28:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:51,142 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1658 transitions. [2024-11-24 01:28:51,143 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-24 01:28:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1658 transitions. [2024-11-24 01:28:51,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-24 01:28:51,146 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:51,146 INFO L218 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-24 01:28:51,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-24 01:28:51,146 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:51,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:51,147 INFO L85 PathProgramCache]: Analyzing trace with hash 172314772, now seen corresponding path program 1 times [2024-11-24 01:28:51,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:51,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507658327] [2024-11-24 01:28:51,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:51,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:51,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:52,955 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-24 01:28:52,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:52,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507658327] [2024-11-24 01:28:52,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507658327] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:52,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:52,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 01:28:52,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591184973] [2024-11-24 01:28:52,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:52,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 01:28:52,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:52,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 01:28:52,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:28:52,959 INFO L87 Difference]: Start difference. First operand 1211 states and 1658 transitions. Second operand has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 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-24 01:28:54,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:54,569 INFO L93 Difference]: Finished difference Result 2415 states and 3306 transitions. [2024-11-24 01:28:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-24 01:28:54,570 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 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-24 01:28:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:54,579 INFO L225 Difference]: With dead ends: 2415 [2024-11-24 01:28:54,579 INFO L226 Difference]: Without dead ends: 1207 [2024-11-24 01:28:54,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-24 01:28:54,584 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 127 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:54,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1676 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-24 01:28:54,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2024-11-24 01:28:54,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 1205. [2024-11-24 01:28:54,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 986 states have (on average 1.2778904665314401) internal successors, (1260), 996 states have internal predecessors, (1260), 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-24 01:28:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1648 transitions. [2024-11-24 01:28:54,737 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1648 transitions. Word has length 166 [2024-11-24 01:28:54,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:54,738 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1648 transitions. [2024-11-24 01:28:54,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.0) internal successors, (64), 9 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-24 01:28:54,738 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1648 transitions. [2024-11-24 01:28:54,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-24 01:28:54,742 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:54,743 INFO L218 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-24 01:28:54,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-24 01:28:54,743 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:54,743 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:54,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1692905112, now seen corresponding path program 1 times [2024-11-24 01:28:54,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:54,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36716087] [2024-11-24 01:28:54,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:54,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:54,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:56,388 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-24 01:28:56,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:56,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36716087] [2024-11-24 01:28:56,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36716087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:56,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:56,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-24 01:28:56,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092737792] [2024-11-24 01:28:56,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:56,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-24 01:28:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:56,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-24 01:28:56,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-24 01:28:56,394 INFO L87 Difference]: Start difference. First operand 1205 states and 1648 transitions. Second operand has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 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-24 01:28:58,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:58,142 INFO L93 Difference]: Finished difference Result 2449 states and 3351 transitions. [2024-11-24 01:28:58,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-24 01:28:58,143 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 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-24 01:28:58,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:58,153 INFO L225 Difference]: With dead ends: 2449 [2024-11-24 01:28:58,153 INFO L226 Difference]: Without dead ends: 1247 [2024-11-24 01:28:58,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-11-24 01:28:58,159 INFO L435 NwaCegarLoop]: 274 mSDtfsCounter, 132 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 2003 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:58,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 2003 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-24 01:28:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2024-11-24 01:28:58,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 1209. [2024-11-24 01:28:58,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 990 states have (on average 1.2767676767676768) internal successors, (1264), 1000 states have internal predecessors, (1264), 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-24 01:28:58,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1652 transitions. [2024-11-24 01:28:58,311 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1652 transitions. Word has length 166 [2024-11-24 01:28:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:58,311 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1652 transitions. [2024-11-24 01:28:58,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.111111111111111) internal successors, (64), 10 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-24 01:28:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1652 transitions. [2024-11-24 01:28:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-24 01:28:58,315 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:58,316 INFO L218 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-24 01:28:58,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-24 01:28:58,316 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:58,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash 681787862, now seen corresponding path program 1 times [2024-11-24 01:28:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:58,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228143319] [2024-11-24 01:28:58,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:28:58,686 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-24 01:28:58,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:28:58,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228143319] [2024-11-24 01:28:58,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [228143319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:28:58,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:28:58,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-24 01:28:58,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58570196] [2024-11-24 01:28:58,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:28:58,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:28:58,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:28:58,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:28:58,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:28:58,691 INFO L87 Difference]: Start difference. First operand 1209 states and 1652 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-24 01:28:59,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:28:59,117 INFO L93 Difference]: Finished difference Result 2437 states and 3312 transitions. [2024-11-24 01:28:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:28:59,118 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-24 01:28:59,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:28:59,125 INFO L225 Difference]: With dead ends: 2437 [2024-11-24 01:28:59,126 INFO L226 Difference]: Without dead ends: 1231 [2024-11-24 01:28:59,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-24 01:28:59,129 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 121 mSDsluCounter, 669 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 881 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-24 01:28:59,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 881 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-24 01:28:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2024-11-24 01:28:59,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 717. [2024-11-24 01:28:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 588 states have (on average 1.2687074829931972) internal successors, (746), 592 states have internal predecessors, (746), 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-24 01:28:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 966 transitions. [2024-11-24 01:28:59,230 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 966 transitions. Word has length 166 [2024-11-24 01:28:59,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:28:59,231 INFO L471 AbstractCegarLoop]: Abstraction has 717 states and 966 transitions. [2024-11-24 01:28:59,232 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-24 01:28:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 966 transitions. [2024-11-24 01:28:59,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-24 01:28:59,234 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:28:59,234 INFO L218 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-24 01:28:59,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-24 01:28:59,235 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:28:59,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:28:59,235 INFO L85 PathProgramCache]: Analyzing trace with hash 234292284, now seen corresponding path program 1 times [2024-11-24 01:28:59,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:28:59,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292741582] [2024-11-24 01:28:59,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:28:59,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:28:59,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:29:00,744 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-24 01:29:00,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:29:00,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292741582] [2024-11-24 01:29:00,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292741582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:29:00,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:29:00,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-24 01:29:00,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984280358] [2024-11-24 01:29:00,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:29:00,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-24 01:29:00,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:29:00,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-24 01:29:00,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-24 01:29:00,746 INFO L87 Difference]: Start difference. First operand 717 states and 966 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-24 01:29:01,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:29:01,249 INFO L93 Difference]: Finished difference Result 1689 states and 2254 transitions. [2024-11-24 01:29:01,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-24 01:29:01,250 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-24 01:29:01,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:29:01,257 INFO L225 Difference]: With dead ends: 1689 [2024-11-24 01:29:01,257 INFO L226 Difference]: Without dead ends: 975 [2024-11-24 01:29:01,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 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-24 01:29:01,260 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 42 mSDsluCounter, 991 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-24 01:29:01,260 INFO L436 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-24 01:29:01,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-24 01:29:01,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 799. [2024-11-24 01:29:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 670 states have (on average 1.2567164179104477) internal successors, (842), 674 states have internal predecessors, (842), 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-24 01:29:01,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1062 transitions. [2024-11-24 01:29:01,346 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1062 transitions. Word has length 167 [2024-11-24 01:29:01,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:29:01,350 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1062 transitions. [2024-11-24 01:29:01,350 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-24 01:29:01,350 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1062 transitions. [2024-11-24 01:29:01,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-24 01:29:01,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:29:01,353 INFO L218 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-24 01:29:01,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-24 01:29:01,354 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:29:01,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:29:01,358 INFO L85 PathProgramCache]: Analyzing trace with hash -313328304, now seen corresponding path program 1 times [2024-11-24 01:29:01,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:29:01,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881249347] [2024-11-24 01:29:01,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:29:01,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:29:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:29:01,963 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-24 01:29:01,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:29:01,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881249347] [2024-11-24 01:29:01,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881249347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:29:01,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:29:01,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-24 01:29:01,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918289159] [2024-11-24 01:29:01,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:29:01,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-24 01:29:01,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:29:01,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-24 01:29:01,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-24 01:29:01,967 INFO L87 Difference]: Start difference. First operand 799 states and 1062 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-24 01:29:02,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:29:02,171 INFO L93 Difference]: Finished difference Result 1627 states and 2167 transitions. [2024-11-24 01:29:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-24 01:29:02,172 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-24 01:29:02,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:29:02,177 INFO L225 Difference]: With dead ends: 1627 [2024-11-24 01:29:02,177 INFO L226 Difference]: Without dead ends: 831 [2024-11-24 01:29:02,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 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-24 01:29:02,180 INFO L435 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-24 01:29:02,180 INFO L436 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-24 01:29:02,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-11-24 01:29:02,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 799. [2024-11-24 01:29:02,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 670 states have (on average 1.2477611940298508) internal successors, (836), 674 states have internal predecessors, (836), 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-24 01:29:02,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1056 transitions. [2024-11-24 01:29:02,278 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1056 transitions. Word has length 167 [2024-11-24 01:29:02,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:29:02,279 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1056 transitions. [2024-11-24 01:29:02,279 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-24 01:29:02,280 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1056 transitions. [2024-11-24 01:29:02,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-24 01:29:02,282 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:29:02,282 INFO L218 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-24 01:29:02,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-24 01:29:02,282 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:29:02,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:29:02,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1454651458, now seen corresponding path program 1 times [2024-11-24 01:29:02,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:29:02,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026355727] [2024-11-24 01:29:02,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:29:02,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:29:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 01:29:02,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1280995140] [2024-11-24 01:29:02,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:29:02,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:29:02,463 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:29:02,465 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:29:02,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-24 01:29:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:29:02,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-24 01:29:02,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:29:02,931 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-24 01:29:02,936 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-24 01:29:02,941 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-24 01:29:02,947 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-24 01:29:02,955 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-24 01:29:03,574 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-24 01:29:03,596 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:29:03,596 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-24 01:29:03,607 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 65 treesize of output 45 [2024-11-24 01:29:03,756 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-24 01:29:03,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:29:03,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:29:03,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026355727] [2024-11-24 01:29:03,757 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-24 01:29:03,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1280995140] [2024-11-24 01:29:03,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1280995140] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:29:03,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:29:03,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-24 01:29:03,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122246166] [2024-11-24 01:29:03,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:29:03,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-24 01:29:03,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:29:03,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-24 01:29:03,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-24 01:29:03,761 INFO L87 Difference]: Start difference. First operand 799 states and 1056 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-24 01:29:05,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:29:05,194 INFO L93 Difference]: Finished difference Result 1715 states and 2272 transitions. [2024-11-24 01:29:05,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:29:05,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-24 01:29:05,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:29:05,203 INFO L225 Difference]: With dead ends: 1715 [2024-11-24 01:29:05,203 INFO L226 Difference]: Without dead ends: 919 [2024-11-24 01:29:05,205 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-24 01:29:05,206 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 200 mSDsluCounter, 935 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:29:05,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1229 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-24 01:29:05,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 919 states. [2024-11-24 01:29:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 919 to 799. [2024-11-24 01:29:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 670 states have (on average 1.2462686567164178) internal successors, (835), 674 states have internal predecessors, (835), 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-24 01:29:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1055 transitions. [2024-11-24 01:29:05,297 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1055 transitions. Word has length 167 [2024-11-24 01:29:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:29:05,298 INFO L471 AbstractCegarLoop]: Abstraction has 799 states and 1055 transitions. [2024-11-24 01:29:05,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-24 01:29:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1055 transitions. [2024-11-24 01:29:05,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-24 01:29:05,301 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:29:05,301 INFO L218 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-24 01:29:05,314 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-24 01:29:05,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:29:05,505 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:29:05,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:29:05,506 INFO L85 PathProgramCache]: Analyzing trace with hash 525719326, now seen corresponding path program 1 times [2024-11-24 01:29:05,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:29:05,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409686110] [2024-11-24 01:29:05,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:29:05,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:29:05,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:29:05,823 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-24 01:29:05,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-24 01:29:05,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409686110] [2024-11-24 01:29:05,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409686110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:29:05,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:29:05,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:29:05,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144163174] [2024-11-24 01:29:05,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:29:05,825 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:29:05,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-24 01:29:05,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:29:05,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:29:05,826 INFO L87 Difference]: Start difference. First operand 799 states and 1055 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-24 01:29:06,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:29:06,094 INFO L93 Difference]: Finished difference Result 1637 states and 2174 transitions. [2024-11-24 01:29:06,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-24 01:29:06,095 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-24 01:29:06,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:29:06,102 INFO L225 Difference]: With dead ends: 1637 [2024-11-24 01:29:06,102 INFO L226 Difference]: Without dead ends: 1216 [2024-11-24 01:29:06,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-24 01:29:06,104 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 154 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-24 01:29:06,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 557 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-24 01:29:06,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2024-11-24 01:29:06,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 1179. [2024-11-24 01:29:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1179 states, 986 states have (on average 1.2423935091277891) internal successors, (1225), 992 states have internal predecessors, (1225), 165 states have call successors, (165), 27 states have call predecessors, (165), 27 states have return successors, (165), 159 states have call predecessors, (165), 165 states have call successors, (165) [2024-11-24 01:29:06,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1179 states to 1179 states and 1555 transitions. [2024-11-24 01:29:06,266 INFO L78 Accepts]: Start accepts. Automaton has 1179 states and 1555 transitions. Word has length 169 [2024-11-24 01:29:06,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:29:06,267 INFO L471 AbstractCegarLoop]: Abstraction has 1179 states and 1555 transitions. [2024-11-24 01:29:06,267 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-24 01:29:06,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1179 states and 1555 transitions. [2024-11-24 01:29:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-24 01:29:06,270 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:29:06,270 INFO L218 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-24 01:29:06,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-24 01:29:06,271 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:29:06,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:29:06,273 INFO L85 PathProgramCache]: Analyzing trace with hash 506062555, now seen corresponding path program 1 times [2024-11-24 01:29:06,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-24 01:29:06,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655566540] [2024-11-24 01:29:06,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:29:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-24 01:29:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-24 01:29:06,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1078907310] [2024-11-24 01:29:06,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:29:06,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:29:06,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:29:06,427 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-24 01:29:06,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-24 01:29:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:29:06,829 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-24 01:29:07,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-24 01:29:07,554 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-24 01:29:07,554 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-24 01:29:07,556 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-24 01:29:07,568 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-24 01:29:07,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-24 01:29:07,763 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-24 01:29:07,871 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-24 01:29:07,878 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.11 01:29:07 BoogieIcfgContainer [2024-11-24 01:29:07,878 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-24 01:29:07,879 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-24 01:29:07,879 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-24 01:29:07,879 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-24 01:29:07,883 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:28:38" (3/4) ... [2024-11-24 01:29:07,886 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-24 01:29:07,887 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-24 01:29:07,888 INFO L158 Benchmark]: Toolchain (without parser) took 31009.52ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 92.9MB in the beginning and 264.3MB in the end (delta: -171.4MB). Peak memory consumption was 143.0MB. Max. memory is 16.1GB. [2024-11-24 01:29:07,891 INFO L158 Benchmark]: CDTParser took 0.53ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:29:07,892 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.74ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 76.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-24 01:29:07,892 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.03ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 73.2MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-24 01:29:07,892 INFO L158 Benchmark]: Boogie Preprocessor took 103.50ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 68.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:29:07,893 INFO L158 Benchmark]: RCFGBuilder took 1246.45ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 87.0MB in the end (delta: -18.6MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2024-11-24 01:29:07,893 INFO L158 Benchmark]: TraceAbstraction took 29108.79ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 86.4MB in the beginning and 264.4MB in the end (delta: -177.9MB). Peak memory consumption was 128.1MB. Max. memory is 16.1GB. [2024-11-24 01:29:07,893 INFO L158 Benchmark]: Witness Printer took 8.24ms. Allocated memory is still 427.8MB. Free memory was 264.4MB in the beginning and 264.3MB in the end (delta: 56.8kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-24 01:29:07,895 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.53ms. Allocated memory is still 117.4MB. Free memory is still 73.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.74ms. Allocated memory is still 117.4MB. Free memory was 92.7MB in the beginning and 76.9MB in the end (delta: 15.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.03ms. Allocated memory is still 117.4MB. Free memory was 76.9MB in the beginning and 73.2MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 103.50ms. Allocated memory is still 117.4MB. Free memory was 73.2MB in the beginning and 68.3MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1246.45ms. Allocated memory is still 117.4MB. Free memory was 68.3MB in the beginning and 87.0MB in the end (delta: -18.6MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * TraceAbstraction took 29108.79ms. Allocated memory was 117.4MB in the beginning and 427.8MB in the end (delta: 310.4MB). Free memory was 86.4MB in the beginning and 264.4MB in the end (delta: -177.9MB). Peak memory consumption was 128.1MB. Max. memory is 16.1GB. * Witness Printer took 8.24ms. Allocated memory is still 427.8MB. Free memory was 264.4MB in the beginning and 264.3MB in the end (delta: 56.8kB). Peak memory consumption was 8.4MB. 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 someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryFLOATComparisonOperation at line 105, overapproximation of someBinaryFLOATComparisonOperation at line 53, overapproximation of someBinaryFLOATComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 53, overapproximation of someBinaryDOUBLEComparisonOperation at line 82, overapproximation of someBinaryDOUBLEComparisonOperation at line 105, overapproximation of someUnaryFLOAToperation at line 53, 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() [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[1][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=3, 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 FALSE !((double_Array_0[0] - ((((float_Array_0[0]) < 0 ) ? -(float_Array_0[0]) : (float_Array_0[0])))) >= float_Array_0[0]) [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 TRUE BOOL_unsigned_char_Array_0[0][1] [L59] EXPR signed_long_int_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}] [L59] COND FALSE !(stepLocal_3 > signed_long_int_Array_0[0]) [L62] EXPR signed_long_int_Array_0[0] [L62] 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}] [L62] COND TRUE (signed_long_int_Array_0[0] % unsigned_char_Array_0[0]) < stepLocal_2 [L63] EXPR BOOL_unsigned_char_Array_0[1][0] [L63] BOOL_unsigned_char_Array_0[0][0] = BOOL_unsigned_char_Array_0[1][0] [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 signed_long_int_Array_0[0] [L105] EXPR signed_long_int_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 (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) [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR unsigned_char_Array_0[0] [L105] EXPR signed_long_int_Array_0[0] [L105] EXPR signed_long_int_Array_0[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_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 [L105] EXPR BOOL_unsigned_char_Array_0[0][0] [L105] EXPR BOOL_unsigned_char_Array_0[1][0] [L105] EXPR ((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 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_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) 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 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: 28.9s, OverallIterations: 19, TraceHistogramMax: 21, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1577 SdHoareTripleChecker+Valid, 6.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1572 mSDsluCounter, 15233 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11633 mSDsCounter, 28 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2775 IncrementalHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 28 mSolverCounterUnsat, 3600 mSDtfsCounter, 2775 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 628 GetRequests, 535 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1211occurred in iteration=11, InterpolantAutomatonStates: 111, 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, 18 MinimizatonAttempts, 1004 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 3780 NumberOfCodeBlocks, 3780 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3251 ConstructedInterpolants, 0 QuantifiedInterpolants, 9422 SizeOfPredicates, 11 NumberOfNonLiveVariables, 1623 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 20 InterpolantComputations, 18 PerfectInterpolantSequences, 16706/16800 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-24 01:29:07,934 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC --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.3.0-dev-6497de0 [2024-11-24 01:29:10,705 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-24 01:29:10,824 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-24 01:29:10,834 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-24 01:29:10,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-24 01:29:10,884 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-24 01:29:10,885 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-24 01:29:10,885 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-24 01:29:10,886 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-24 01:29:10,886 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-24 01:29:10,887 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-24 01:29:10,888 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-24 01:29:10,889 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-24 01:29:10,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-24 01:29:10,890 INFO L153 SettingsManager]: * Use SBE=true [2024-11-24 01:29:10,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-24 01:29:10,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-24 01:29:10,890 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-24 01:29:10,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-24 01:29:10,890 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-24 01:29:10,890 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-24 01:29:10,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-24 01:29:10,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-24 01:29:10,891 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-24 01:29:10,891 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-24 01:29:10,891 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-24 01:29:10,891 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-24 01:29:10,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-24 01:29:10,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-24 01:29:10,891 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-24 01:29:10,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-24 01:29:10,891 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:29:10,891 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:29:10,891 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:29:10,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:29:10,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-24 01:29:10,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-24 01:29:10,892 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-24 01:29:10,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-24 01:29:10,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:29:10,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-24 01:29:10,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-24 01:29:10,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-24 01:29:10,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-24 01:29:10,892 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-24 01:29:10,893 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-24 01:29:10,893 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-24 01:29:10,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-24 01:29:10,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-24 01:29:10,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-24 01:29:10,893 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC 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-24 01:29:11,280 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-24 01:29:11,293 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-24 01:29:11,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-24 01:29:11,299 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-24 01:29:11,300 INFO L274 PluginConnector]: CDTParser initialized [2024-11-24 01:29:11,303 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-11-24 01:29:14,502 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/data/3c9063eaf/b3447ec28ea94a85a3498cc6f3ec0cf9/FLAG8fe0244ae [2024-11-24 01:29:14,785 INFO L384 CDTParser]: Found 1 translation units. [2024-11-24 01:29:14,790 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i [2024-11-24 01:29:14,813 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/data/3c9063eaf/b3447ec28ea94a85a3498cc6f3ec0cf9/FLAG8fe0244ae [2024-11-24 01:29:14,855 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/data/3c9063eaf/b3447ec28ea94a85a3498cc6f3ec0cf9 [2024-11-24 01:29:14,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-24 01:29:14,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-24 01:29:14,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-24 01:29:14,867 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-24 01:29:14,873 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-24 01:29:14,874 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:29:14" (1/1) ... [2024-11-24 01:29:14,875 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f3c1b4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:14, skipping insertion in model container [2024-11-24 01:29:14,877 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.11 01:29:14" (1/1) ... [2024-11-24 01:29:14,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-24 01:29:15,100 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_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i[916,929] [2024-11-24 01:29:15,239 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:29:15,256 INFO L200 MainTranslator]: Completed pre-run [2024-11-24 01:29:15,271 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_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-44.i[916,929] [2024-11-24 01:29:15,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-24 01:29:15,408 INFO L204 MainTranslator]: Completed translation [2024-11-24 01:29:15,408 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15 WrapperNode [2024-11-24 01:29:15,409 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-24 01:29:15,410 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-24 01:29:15,410 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-24 01:29:15,410 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-24 01:29:15,418 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,434 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,475 INFO L138 Inliner]: procedures = 36, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 488 [2024-11-24 01:29:15,475 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-24 01:29:15,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-24 01:29:15,476 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-24 01:29:15,476 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-24 01:29:15,494 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,494 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,502 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,529 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-24 01:29:15,530 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,558 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,560 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,565 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,575 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,597 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-24 01:29:15,598 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-24 01:29:15,598 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-24 01:29:15,598 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-24 01:29:15,599 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (1/1) ... [2024-11-24 01:29:15,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-24 01:29:15,630 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 [2024-11-24 01:29:15,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-24 01:29:15,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-24 01:29:15,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-24 01:29:15,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-24 01:29:15,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-24 01:29:15,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2024-11-24 01:29:15,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2024-11-24 01:29:15,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2024-11-24 01:29:15,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2024-11-24 01:29:15,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2024-11-24 01:29:15,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-24 01:29:15,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-24 01:29:15,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-24 01:29:15,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2024-11-24 01:29:15,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2024-11-24 01:29:15,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2024-11-24 01:29:15,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2024-11-24 01:29:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-24 01:29:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-24 01:29:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-24 01:29:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-24 01:29:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-24 01:29:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-24 01:29:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-24 01:29:15,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-24 01:29:15,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-24 01:29:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-24 01:29:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-24 01:29:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-24 01:29:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-24 01:29:15,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#6 [2024-11-24 01:29:15,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-24 01:29:15,693 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-24 01:29:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-24 01:29:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-24 01:29:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2024-11-24 01:29:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2024-11-24 01:29:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2024-11-24 01:29:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2024-11-24 01:29:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#6 [2024-11-24 01:29:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2024-11-24 01:29:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2024-11-24 01:29:15,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2024-11-24 01:29:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2024-11-24 01:29:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2024-11-24 01:29:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2024-11-24 01:29:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#6 [2024-11-24 01:29:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-24 01:29:15,695 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-24 01:29:15,695 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-24 01:29:15,695 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-24 01:29:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-24 01:29:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-24 01:29:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-24 01:29:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-24 01:29:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-24 01:29:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-24 01:29:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-24 01:29:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-24 01:29:15,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-24 01:29:15,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-24 01:29:15,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2024-11-24 01:29:15,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2024-11-24 01:29:15,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2024-11-24 01:29:15,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#6 [2024-11-24 01:29:15,969 INFO L234 CfgBuilder]: Building ICFG [2024-11-24 01:29:15,971 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-24 01:29:22,134 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2024-11-24 01:29:22,134 INFO L283 CfgBuilder]: Performing block encoding [2024-11-24 01:29:22,148 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-24 01:29:22,148 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-24 01:29:22,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:29:22 BoogieIcfgContainer [2024-11-24 01:29:22,148 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-24 01:29:22,151 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-24 01:29:22,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-24 01:29:22,157 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-24 01:29:22,157 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.11 01:29:14" (1/3) ... [2024-11-24 01:29:22,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1591dc41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:29:22, skipping insertion in model container [2024-11-24 01:29:22,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.11 01:29:15" (2/3) ... [2024-11-24 01:29:22,158 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1591dc41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.11 01:29:22, skipping insertion in model container [2024-11-24 01:29:22,158 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.11 01:29:22" (3/3) ... [2024-11-24 01:29:22,160 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-44.i [2024-11-24 01:29:22,176 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-24 01:29:22,178 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-44.i that has 2 procedures, 118 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-24 01:29:22,247 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-24 01:29:22,261 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;@4106d3fc, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-24 01:29:22,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-24 01:29:22,267 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-24 01:29:22,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-24 01:29:22,282 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:29:22,283 INFO L218 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-24 01:29:22,283 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:29:22,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:29:22,289 INFO L85 PathProgramCache]: Analyzing trace with hash -882731756, now seen corresponding path program 1 times [2024-11-24 01:29:22,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:29:22,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [238733006] [2024-11-24 01:29:22,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:29:22,303 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-24 01:29:22,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:29:22,308 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:22,310 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:22,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:29:22,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-24 01:29:22,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:29:22,942 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-24 01:29:22,942 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:29:22,945 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:29:22,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [238733006] [2024-11-24 01:29:22,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [238733006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:29:22,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:29:22,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-24 01:29:22,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120071803] [2024-11-24 01:29:22,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:29:22,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-24 01:29:22,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:29:23,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-24 01:29:23,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-24 01:29:23,023 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-24 01:29:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:29:23,054 INFO L93 Difference]: Finished difference Result 229 states and 359 transitions. [2024-11-24 01:29:23,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-24 01:29:23,056 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-24 01:29:23,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:29:23,064 INFO L225 Difference]: With dead ends: 229 [2024-11-24 01:29:23,064 INFO L226 Difference]: Without dead ends: 114 [2024-11-24 01:29:23,068 INFO L434 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-24 01:29:23,072 INFO L435 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-24 01:29:23,073 INFO L436 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-24 01:29:23,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-24 01:29:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2024-11-24 01:29:23,126 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-24 01:29:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 165 transitions. [2024-11-24 01:29:23,139 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 165 transitions. Word has length 159 [2024-11-24 01:29:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:29:23,141 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 165 transitions. [2024-11-24 01:29:23,142 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-24 01:29:23,142 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 165 transitions. [2024-11-24 01:29:23,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-24 01:29:23,149 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:29:23,149 INFO L218 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-24 01:29:23,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:23,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:23,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:29:23,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:29:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1168682478, now seen corresponding path program 1 times [2024-11-24 01:29:23,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:29:23,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [907004915] [2024-11-24 01:29:23,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:29:23,355 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-24 01:29:23,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:29:23,357 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:23,361 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:29:23,920 INFO L256 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-24 01:29:23,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:29:23,995 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-24 01:29:24,165 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-24 01:29:24,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:29:24,165 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:29:24,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [907004915] [2024-11-24 01:29:24,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [907004915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:29:24,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:29:24,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:29:24,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740951915] [2024-11-24 01:29:24,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:29:24,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:29:24,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:29:24,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:29:24,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:29:24,173 INFO L87 Difference]: Start difference. First operand 114 states and 165 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-24 01:29:25,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:29:27,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:29:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:29:28,806 INFO L93 Difference]: Finished difference Result 323 states and 469 transitions. [2024-11-24 01:29:28,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:29:28,808 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-24 01:29:28,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:29:28,814 INFO L225 Difference]: With dead ends: 323 [2024-11-24 01:29:28,814 INFO L226 Difference]: Without dead ends: 212 [2024-11-24 01:29:28,815 INFO L434 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-24 01:29:28,816 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 130 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s 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.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:29:28,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 838 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-24 01:29:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-24 01:29:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2024-11-24 01:29:28,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 169 states have (on average 1.3609467455621302) internal successors, (230), 170 states have internal predecessors, (230), 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-24 01:29:28,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 304 transitions. [2024-11-24 01:29:28,870 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 304 transitions. Word has length 159 [2024-11-24 01:29:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:29:28,874 INFO L471 AbstractCegarLoop]: Abstraction has 209 states and 304 transitions. [2024-11-24 01:29:28,874 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-24 01:29:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 304 transitions. [2024-11-24 01:29:28,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-24 01:29:28,879 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:29:28,879 INFO L218 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-24 01:29:28,891 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-24 01:29:29,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:29,080 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:29:29,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:29:29,081 INFO L85 PathProgramCache]: Analyzing trace with hash 212087556, now seen corresponding path program 1 times [2024-11-24 01:29:29,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:29:29,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224648169] [2024-11-24 01:29:29,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:29:29,082 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-24 01:29:29,082 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:29:29,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:29,086 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:29,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:29:29,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:29:29,554 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:29:29,627 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-24 01:29:29,627 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:29:29,627 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:29:29,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224648169] [2024-11-24 01:29:29,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224648169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:29:29,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:29:29,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:29:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583912542] [2024-11-24 01:29:29,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:29:29,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:29:29,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:29:29,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:29:29,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:29:29,630 INFO L87 Difference]: Start difference. First operand 209 states and 304 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-24 01:29:29,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:29:29,771 INFO L93 Difference]: Finished difference Result 425 states and 619 transitions. [2024-11-24 01:29:29,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:29:29,772 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-24 01:29:29,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:29:29,776 INFO L225 Difference]: With dead ends: 425 [2024-11-24 01:29:29,776 INFO L226 Difference]: Without dead ends: 219 [2024-11-24 01:29:29,778 INFO L434 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-24 01:29:29,779 INFO L435 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-24 01:29:29,779 INFO L436 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-24 01:29:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-24 01:29:29,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2024-11-24 01:29:29,801 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-24 01:29:29,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 312 transitions. [2024-11-24 01:29:29,804 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 312 transitions. Word has length 160 [2024-11-24 01:29:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:29:29,805 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 312 transitions. [2024-11-24 01:29:29,805 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-24 01:29:29,806 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 312 transitions. [2024-11-24 01:29:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-24 01:29:29,808 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:29:29,809 INFO L218 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-24 01:29:29,819 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:30,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:30,009 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:29:30,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:29:30,010 INFO L85 PathProgramCache]: Analyzing trace with hash 213934598, now seen corresponding path program 1 times [2024-11-24 01:29:30,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:29:30,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109432297] [2024-11-24 01:29:30,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:29:30,011 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-24 01:29:30,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:29:30,017 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:30,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:30,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:29:30,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-24 01:29:30,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:29:30,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:29:30,926 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-24 01:29:30,997 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-24 01:29:30,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:29:30,998 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:29:30,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109432297] [2024-11-24 01:29:30,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109432297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:29:30,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:29:30,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:29:30,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817658661] [2024-11-24 01:29:30,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:29:31,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-24 01:29:31,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:29:31,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-24 01:29:31,001 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-24 01:29:31,001 INFO L87 Difference]: Start difference. First operand 217 states and 312 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-24 01:29:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:29:35,744 INFO L93 Difference]: Finished difference Result 433 states and 623 transitions. [2024-11-24 01:29:35,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-24 01:29:35,759 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-24 01:29:35,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:29:35,761 INFO L225 Difference]: With dead ends: 433 [2024-11-24 01:29:35,761 INFO L226 Difference]: Without dead ends: 219 [2024-11-24 01:29:35,762 INFO L434 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-24 01:29:35,763 INFO L435 NwaCegarLoop]: 146 mSDtfsCounter, 133 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s 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, 4.6s IncrementalHoareTripleChecker+Time [2024-11-24 01:29:35,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 532 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2024-11-24 01:29:35,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-24 01:29:35,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2024-11-24 01:29:35,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 177 states have (on average 1.3333333333333333) internal successors, (236), 178 states have internal predecessors, (236), 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-24 01:29:35,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 310 transitions. [2024-11-24 01:29:35,783 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 310 transitions. Word has length 160 [2024-11-24 01:29:35,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:29:35,783 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 310 transitions. [2024-11-24 01:29:35,783 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-24 01:29:35,784 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 310 transitions. [2024-11-24 01:29:35,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-24 01:29:35,786 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:29:35,786 INFO L218 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-24 01:29:35,796 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:35,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:35,987 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:29:35,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:29:35,988 INFO L85 PathProgramCache]: Analyzing trace with hash -918830132, now seen corresponding path program 1 times [2024-11-24 01:29:35,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:29:35,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1327009658] [2024-11-24 01:29:35,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:29:35,988 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-24 01:29:35,989 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:29:35,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:35,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:29:36,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:29:36,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-24 01:29:36,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:29:43,138 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:29:43,138 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-24 01:29:43,183 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-24 01:29:43,934 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:29:43,935 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-24 01:29:51,813 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-24 01:29:51,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:33:17,403 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:33:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1327009658] [2024-11-24 01:33:17,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1327009658] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:33:17,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [774192305] [2024-11-24 01:33:17,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:33:17,404 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-24 01:33:17,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/cvc4 [2024-11-24 01:33:17,407 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-24 01:33:17,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-24 01:33:18,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:33:18,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-24 01:33:18,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:33:36,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:33:36,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 25 [2024-11-24 01:34:05,478 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-24 01:34:05,478 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:34:05,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [774192305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:34:05,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:34:05,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2024-11-24 01:34:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894905063] [2024-11-24 01:34:05,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:34:05,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:34:05,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:34:05,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:34:05,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=462, Unknown=18, NotChecked=0, Total=552 [2024-11-24 01:34:05,480 INFO L87 Difference]: Start difference. First operand 217 states and 310 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-24 01:34:09,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:34:12,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:34:22,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:34:24,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:34:25,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:34:28,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:34:31,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:34:32,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:34:35,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-24 01:34:36,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-24 01:34:38,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:34:38,239 INFO L93 Difference]: Finished difference Result 469 states and 668 transitions. [2024-11-24 01:34:38,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:34:38,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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 162 [2024-11-24 01:34:38,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:34:38,244 INFO L225 Difference]: With dead ends: 469 [2024-11-24 01:34:38,244 INFO L226 Difference]: Without dead ends: 255 [2024-11-24 01:34:38,245 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 211.0s TimeCoverageRelationStatistics Valid=76, Invalid=506, Unknown=18, NotChecked=0, Total=600 [2024-11-24 01:34:38,246 INFO L435 NwaCegarLoop]: 271 mSDtfsCounter, 113 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 27.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 900 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 27.5s IncrementalHoareTripleChecker+Time [2024-11-24 01:34:38,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 900 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 27.5s Time] [2024-11-24 01:34:38,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2024-11-24 01:34:38,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 252. [2024-11-24 01:34:38,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 203 states have internal predecessors, (264), 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-24 01:34:38,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 358 transitions. [2024-11-24 01:34:38,271 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 358 transitions. Word has length 162 [2024-11-24 01:34:38,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:34:38,272 INFO L471 AbstractCegarLoop]: Abstraction has 252 states and 358 transitions. [2024-11-24 01:34:38,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 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-24 01:34:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 358 transitions. [2024-11-24 01:34:38,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-24 01:34:38,276 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:34:38,276 INFO L218 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-24 01:34:38,286 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:34:38,484 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-24 01:34:38,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt [2024-11-24 01:34:38,677 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:34:38,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:34:38,678 INFO L85 PathProgramCache]: Analyzing trace with hash -1686048075, now seen corresponding path program 1 times [2024-11-24 01:34:38,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:34:38,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [356705679] [2024-11-24 01:34:38,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:34:38,679 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-24 01:34:38,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:34:38,680 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:34:38,682 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-24 01:34:39,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:34:39,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-24 01:34:39,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:34:39,871 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-24 01:34:39,871 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:34:39,872 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:34:39,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [356705679] [2024-11-24 01:34:39,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [356705679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:34:39,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-24 01:34:39,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-24 01:34:39,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907898240] [2024-11-24 01:34:39,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:34:39,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:34:39,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:34:39,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:34:39,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:34:39,875 INFO L87 Difference]: Start difference. First operand 252 states and 358 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-24 01:34:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:34:40,855 INFO L93 Difference]: Finished difference Result 476 states and 675 transitions. [2024-11-24 01:34:40,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:34:40,856 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-24 01:34:40,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:34:40,859 INFO L225 Difference]: With dead ends: 476 [2024-11-24 01:34:40,860 INFO L226 Difference]: Without dead ends: 258 [2024-11-24 01:34:40,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-24 01:34:40,862 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 0 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-24 01:34:40,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 627 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-24 01:34:40,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-24 01:34:40,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2024-11-24 01:34:40,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 207 states have (on average 1.3043478260869565) internal successors, (270), 209 states have internal predecessors, (270), 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-24 01:34:40,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 364 transitions. [2024-11-24 01:34:40,901 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 364 transitions. Word has length 163 [2024-11-24 01:34:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:34:40,904 INFO L471 AbstractCegarLoop]: Abstraction has 258 states and 364 transitions. [2024-11-24 01:34:40,904 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-24 01:34:40,904 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 364 transitions. [2024-11-24 01:34:40,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-24 01:34:40,908 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:34:40,909 INFO L218 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-24 01:34:40,920 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-24 01:34:41,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:34:41,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:34:41,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:34:41,110 INFO L85 PathProgramCache]: Analyzing trace with hash 363744066, now seen corresponding path program 1 times [2024-11-24 01:34:41,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:34:41,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482005434] [2024-11-24 01:34:41,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:34:41,110 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-24 01:34:41,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:34:41,112 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:34:41,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:34:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:34:41,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-24 01:34:41,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:35:22,953 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-24 01:35:23,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:23,228 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-24 01:35:26,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:35:26,672 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-24 01:35:40,918 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-24 01:35:40,918 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-24 01:39:03,991 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-24 01:39:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482005434] [2024-11-24 01:39:03,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482005434] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-24 01:39:03,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [152340913] [2024-11-24 01:39:03,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:39:03,992 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-24 01:39:03,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/cvc4 [2024-11-24 01:39:03,994 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-24 01:39:03,995 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-24 01:39:05,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:39:05,398 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-24 01:39:05,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:39:20,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:39:20,969 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 41 treesize of output 17 [2024-11-24 01:39:33,711 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-24 01:39:33,711 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-24 01:39:33,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [152340913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-24 01:39:33,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-24 01:39:33,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [16] total 20 [2024-11-24 01:39:33,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419659075] [2024-11-24 01:39:33,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-24 01:39:33,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-24 01:39:33,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-24 01:39:33,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-24 01:39:33,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=461, Unknown=18, NotChecked=0, Total=552 [2024-11-24 01:39:33,713 INFO L87 Difference]: Start difference. First operand 258 states and 364 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (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-24 01:39:47,531 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-24 01:39:51,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-24 01:39:51,883 INFO L93 Difference]: Finished difference Result 687 states and 965 transitions. [2024-11-24 01:39:51,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-24 01:39:51,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (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-24 01:39:51,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-24 01:39:51,889 INFO L225 Difference]: With dead ends: 687 [2024-11-24 01:39:51,889 INFO L226 Difference]: Without dead ends: 463 [2024-11-24 01:39:51,890 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 334 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 206.9s TimeCoverageRelationStatistics Valid=77, Invalid=505, Unknown=18, NotChecked=0, Total=600 [2024-11-24 01:39:51,892 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 124 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.7s IncrementalHoareTripleChecker+Time [2024-11-24 01:39:51,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 718 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 12.7s Time] [2024-11-24 01:39:51,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-11-24 01:39:51,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 459. [2024-11-24 01:39:51,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 377 states have (on average 1.312997347480106) internal successors, (495), 381 states have internal predecessors, (495), 75 states have call successors, (75), 6 states have call predecessors, (75), 6 states have return successors, (75), 71 states have call predecessors, (75), 75 states have call successors, (75) [2024-11-24 01:39:51,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 645 transitions. [2024-11-24 01:39:51,944 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 645 transitions. Word has length 165 [2024-11-24 01:39:51,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-24 01:39:51,945 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 645 transitions. [2024-11-24 01:39:51,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (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-24 01:39:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 645 transitions. [2024-11-24 01:39:51,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-24 01:39:51,952 INFO L210 NwaCegarLoop]: Found error trace [2024-11-24 01:39:51,952 INFO L218 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-24 01:39:51,965 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:39:52,160 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2024-11-24 01:39:52,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/cvc4 --incremental --print-success --lang smt [2024-11-24 01:39:52,353 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-24 01:39:52,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-24 01:39:52,354 INFO L85 PathProgramCache]: Analyzing trace with hash -647373184, now seen corresponding path program 1 times [2024-11-24 01:39:52,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-24 01:39:52,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [973357673] [2024-11-24 01:39:52,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-24 01:39:52,354 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-24 01:39:52,354 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/mathsat [2024-11-24 01:39:52,356 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:39:52,357 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_57cca471-272a-48b8-a1d3-e0bffd1cf2e1/bin/uautomizer-verify-LYvppIcaGC/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-24 01:39:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-24 01:39:53,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-24 01:39:53,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-24 01:40:40,252 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-24 01:40:40,580 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:40:40,580 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-24 01:40:44,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-24 01:40:44,733 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-24 01:41:01,496 WARN L286 SmtUtils]: Spent 6.07s 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-24 01:41:11,630 WARN L286 SmtUtils]: Spent 5.55s 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-24 01:41:17,188 WARN L286 SmtUtils]: Spent 5.56s 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-24 01:41:22,506 WARN L286 SmtUtils]: Spent 5.32s 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-24 01:41:31,136 WARN L851 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_21 (_ BitVec 32)) (v_arrayElimCell_20 (_ BitVec 32)) (v_arrayElimCell_22 (_ BitVec 32)) (v_arrayElimCell_19 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_21) ((_ extract 30 23) v_arrayElimCell_21) ((_ extract 22 0) v_arrayElimCell_21))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_22) ((_ extract 30 23) v_arrayElimCell_22) ((_ extract 22 0) v_arrayElimCell_22))) (.cse0 (let ((.cse4 (concat v_arrayElimCell_20 v_arrayElimCell_19))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4)))) (.cse3 ((_ to_fp 8 24) roundNearestTiesToEven (/ 1.0 100000000000000000000.0)))) (and (not (fp.geq (fp.sub roundNearestTiesToEven .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg .cse1))) ((_ to_fp 11 53) roundNearestTiesToEven .cse1))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven 9223372036854776000.0))) (= .cse1 .cse2) (fp.leq .cse2 (fp.neg .cse3)) (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven .cse3))))) is different from false [2024-11-24 01:41:47,805 WARN L286 SmtUtils]: Spent 5.13s 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-24 01:41:52,854 WARN L286 SmtUtils]: Spent 5.05s 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-24 01:41:58,032 WARN L286 SmtUtils]: Spent 5.18s 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-24 01:42:21,423 WARN L286 SmtUtils]: Spent 5.17s 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-24 01:42:45,943 WARN L286 SmtUtils]: Spent 6.08s 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-24 01:42:51,824 WARN L286 SmtUtils]: Spent 5.88s 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-24 01:42:56,982 WARN L286 SmtUtils]: Spent 5.16s 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-24 01:43:20,835 WARN L286 SmtUtils]: Spent 5.32s 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-24 01:43:26,626 WARN L286 SmtUtils]: Spent 5.79s 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)